./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-64.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '0afd03d96250b15a3092af5b8545562faa42b0b4fabe531d4bd1ca219b78fa15'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-64.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0afd03d96250b15a3092af5b8545562faa42b0b4fabe531d4bd1ca219b78fa15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:55:03,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:55:03,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:55:03,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:55:03,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:55:03,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:55:03,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:55:03,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:55:03,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:55:03,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:55:03,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:55:03,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:55:03,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:55:03,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:55:03,289 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:55:03,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:55:03,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:55:03,289 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:55:03,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:55:03,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:55:03,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:55:03,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:55:03,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:55:03,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:55:03,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:55:03,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:55:03,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:55:03,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:55:03,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:55:03,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:55:03,292 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0afd03d96250b15a3092af5b8545562faa42b0b4fabe531d4bd1ca219b78fa15 [2024-11-07 06:55:03,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:55:03,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:55:03,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:55:03,614 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:55:03,614 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:55:03,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-64.i [2024-11-07 06:55:04,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:55:05,216 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:55:05,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-64.i [2024-11-07 06:55:05,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb31ca100/e169861e615841bc81864c1c9db15f74/FLAGd20581d92 [2024-11-07 06:55:05,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb31ca100/e169861e615841bc81864c1c9db15f74 [2024-11-07 06:55:05,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:55:05,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:55:05,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:55:05,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:55:05,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:55:05,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5000fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05, skipping insertion in model container [2024-11-07 06:55:05,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:55:05,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-64.i[919,932] [2024-11-07 06:55:05,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:55:05,459 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:55:05,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-64.i[919,932] [2024-11-07 06:55:05,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:55:05,514 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:55:05,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05 WrapperNode [2024-11-07 06:55:05,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:55:05,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:55:05,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:55:05,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:55:05,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,588 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-11-07 06:55:05,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:55:05,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:55:05,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:55:05,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:55:05,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,629 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:55:05,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:55:05,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:55:05,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:55:05,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:55:05,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (1/1) ... [2024-11-07 06:55:05,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:55:05,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:55:05,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:55:05,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:55:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:55:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:55:05,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:55:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:55:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:55:05,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:55:05,803 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:55:05,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:55:06,105 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 06:55:06,105 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:55:06,114 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:55:06,114 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:55:06,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:55:06 BoogieIcfgContainer [2024-11-07 06:55:06,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:55:06,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:55:06,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:55:06,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:55:06,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:55:05" (1/3) ... [2024-11-07 06:55:06,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0ddda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:55:06, skipping insertion in model container [2024-11-07 06:55:06,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:55:05" (2/3) ... [2024-11-07 06:55:06,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0ddda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:55:06, skipping insertion in model container [2024-11-07 06:55:06,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:55:06" (3/3) ... [2024-11-07 06:55:06,124 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-64.i [2024-11-07 06:55:06,137 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:55:06,137 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:55:06,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:55:06,202 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e100b26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:55:06,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:55:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:55:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-07 06:55:06,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:55:06,231 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:55:06,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:55:06,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:55:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1202833957, now seen corresponding path program 1 times [2024-11-07 06:55:06,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:55:06,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827730075] [2024-11-07 06:55:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:55:06,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:55:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:55:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:55:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:55:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:55:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:55:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:55:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:55:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:55:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:55:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:55:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:55:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:55:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:55:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:55:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:55:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:55:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:55:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 06:55:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:55:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 06:55:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:55:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 06:55:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:55:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 06:55:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:55:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:55:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:55:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:55:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:55:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:55:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827730075] [2024-11-07 06:55:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827730075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:55:06,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:55:06,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:55:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576618177] [2024-11-07 06:55:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:55:06,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:55:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:55:06,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:55:06,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:55:06,664 INFO L87 Difference]: Start difference. First operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 06:55:06,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:55:06,691 INFO L93 Difference]: Finished difference Result 173 states and 302 transitions. [2024-11-07 06:55:06,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:55:06,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-11-07 06:55:06,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:55:06,700 INFO L225 Difference]: With dead ends: 173 [2024-11-07 06:55:06,700 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 06:55:06,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:55:06,708 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:55:06,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:55:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 06:55:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 06:55:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:55:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-07 06:55:06,750 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 183 [2024-11-07 06:55:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:55:06,751 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-07 06:55:06,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 06:55:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-07 06:55:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-07 06:55:06,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:55:06,757 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:55:06,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:55:06,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:55:06,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:55:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash 42587369, now seen corresponding path program 1 times [2024-11-07 06:55:06,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:55:06,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088731519] [2024-11-07 06:55:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:55:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:55:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:55:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:55:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:55:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:55:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:55:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:55:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:55:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:55:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:55:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:55:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:55:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:55:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:55:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:55:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:55:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:55:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:55:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 06:55:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:55:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 06:55:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:55:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 06:55:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:55:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 06:55:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:55:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:55:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:55:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:55:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:55:07,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:55:07,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088731519] [2024-11-07 06:55:07,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088731519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:55:07,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:55:07,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:55:07,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110151155] [2024-11-07 06:55:07,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:55:07,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:55:07,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:55:07,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:55:07,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:55:07,430 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:55:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:55:07,731 INFO L93 Difference]: Finished difference Result 261 states and 401 transitions. [2024-11-07 06:55:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:55:07,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-07 06:55:07,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:55:07,735 INFO L225 Difference]: With dead ends: 261 [2024-11-07 06:55:07,735 INFO L226 Difference]: Without dead ends: 178 [2024-11-07 06:55:07,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:55:07,736 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 143 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:55:07,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 621 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:55:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-07 06:55:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 90. [2024-11-07 06:55:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:55:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2024-11-07 06:55:07,761 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 183 [2024-11-07 06:55:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:55:07,765 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2024-11-07 06:55:07,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:55:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2024-11-07 06:55:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-07 06:55:07,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:55:07,767 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:55:07,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:55:07,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:55:07,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:55:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash -766759257, now seen corresponding path program 1 times [2024-11-07 06:55:07,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:55:07,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364096711] [2024-11-07 06:55:07,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:55:07,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:55:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:55:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:55:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:55:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:55:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:55:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:55:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:55:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:55:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:55:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:55:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:55:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:55:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:55:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:55:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:55:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:55:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:55:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 06:55:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:55:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 06:55:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:55:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 06:55:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:55:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 06:55:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:55:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:55:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:55:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:55:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:55:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:55:08,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364096711] [2024-11-07 06:55:08,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364096711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:55:08,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:55:08,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:55:08,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249721843] [2024-11-07 06:55:08,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:55:08,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:55:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:55:08,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:55:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:55:08,058 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:55:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:55:08,227 INFO L93 Difference]: Finished difference Result 265 states and 406 transitions. [2024-11-07 06:55:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:55:08,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-07 06:55:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:55:08,230 INFO L225 Difference]: With dead ends: 265 [2024-11-07 06:55:08,230 INFO L226 Difference]: Without dead ends: 178 [2024-11-07 06:55:08,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:55:08,231 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 133 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:55:08,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 671 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:55:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-07 06:55:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 90. [2024-11-07 06:55:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:55:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2024-11-07 06:55:08,254 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 183 [2024-11-07 06:55:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:55:08,255 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2024-11-07 06:55:08,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:55:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2024-11-07 06:55:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-07 06:55:08,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:55:08,259 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:55:08,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:55:08,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:55:08,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:55:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash -474565655, now seen corresponding path program 1 times [2024-11-07 06:55:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:55:08,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413699969] [2024-11-07 06:55:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:55:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:55:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:55:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:55:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:55:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:55:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:55:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:55:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:55:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:55:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:55:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:55:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:55:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:55:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:55:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:55:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:55:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:55:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:55:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 06:55:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:55:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 06:55:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:55:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 06:55:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:55:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 06:55:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:55:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:55:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:55:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:55:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:55:10,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:55:10,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413699969] [2024-11-07 06:55:10,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413699969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:55:10,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:55:10,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:55:10,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294636658] [2024-11-07 06:55:10,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:55:10,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:55:10,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:55:10,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:55:10,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:55:10,829 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:55:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:55:11,183 INFO L93 Difference]: Finished difference Result 311 states and 483 transitions. [2024-11-07 06:55:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:55:11,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-07 06:55:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:55:11,187 INFO L225 Difference]: With dead ends: 311 [2024-11-07 06:55:11,187 INFO L226 Difference]: Without dead ends: 224 [2024-11-07 06:55:11,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:55:11,188 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 174 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:55:11,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 615 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:55:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-07 06:55:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 86. [2024-11-07 06:55:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:55:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2024-11-07 06:55:11,197 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 183 [2024-11-07 06:55:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:55:11,198 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2024-11-07 06:55:11,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:55:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2024-11-07 06:55:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-07 06:55:11,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:55:11,199 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:55:11,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:55:11,199 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:55:11,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:55:11,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1723302596, now seen corresponding path program 1 times [2024-11-07 06:55:11,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:55:11,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009244803] [2024-11-07 06:55:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:55:11,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:55:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat