./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.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_loopvsstraightlinecode_25-while_file-82.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', '0f5f56644b3db98e889fbbdbdbf88f43e5157acb1dba68661da1592e817fffbd'] 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_loopvsstraightlinecode_25-while_file-82.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 0f5f56644b3db98e889fbbdbdbf88f43e5157acb1dba68661da1592e817fffbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:35:59,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:36:00,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:36:00,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:36:00,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:36:00,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:36:00,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:36:00,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:36:00,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:36:00,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:36:00,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:36:00,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:36:00,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:36:00,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:36:00,093 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:36:00,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:36:00,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:36:00,093 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:36:00,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:36:00,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:36:00,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:36:00,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:36:00,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:36:00,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:36:00,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:36:00,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:36:00,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:36:00,095 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:36:00,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:36:00,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:36:00,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:36:00,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:36:00,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:36:00,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:36:00,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:36:00,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:36:00,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:36:00,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:36:00,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:36:00,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:36:00,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:36:00,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:36:00,096 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 -> 0f5f56644b3db98e889fbbdbdbf88f43e5157acb1dba68661da1592e817fffbd [2024-11-07 08:36:00,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:36:00,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:36:00,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:36:00,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:36:00,400 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:36:00,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i [2024-11-07 08:36:01,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:36:01,978 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:36:01,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i [2024-11-07 08:36:01,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e04fb5fd0/dadce5e45d1547df843665bf6803cc25/FLAG3278a310a [2024-11-07 08:36:02,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e04fb5fd0/dadce5e45d1547df843665bf6803cc25 [2024-11-07 08:36:02,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:36:02,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:36:02,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:36:02,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:36:02,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:36:02,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d10571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02, skipping insertion in model container [2024-11-07 08:36:02,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:36:02,439 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_loopvsstraightlinecode_25-while_file-82.i[915,928] [2024-11-07 08:36:02,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:36:02,500 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:36:02,512 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_loopvsstraightlinecode_25-while_file-82.i[915,928] [2024-11-07 08:36:02,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:36:02,561 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:36:02,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02 WrapperNode [2024-11-07 08:36:02,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:36:02,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:36:02,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:36:02,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:36:02,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,622 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-11-07 08:36:02,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:36:02,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:36:02,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:36:02,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:36:02,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,658 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 08:36:02,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:36:02,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:36:02,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:36:02,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:36:02,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (1/1) ... [2024-11-07 08:36:02,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:36:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:36:02,733 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 08:36:02,742 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 08:36:02,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:36:02,763 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:36:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:36:02,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:36:02,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:36:02,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:36:02,831 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:36:02,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:36:02,973 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 08:36:02,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:36:02,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:36:02,979 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:36:02,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:02 BoogieIcfgContainer [2024-11-07 08:36:02,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:36:02,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:36:02,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:36:02,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:36:02,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:36:02" (1/3) ... [2024-11-07 08:36:02,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564b2ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:36:02, skipping insertion in model container [2024-11-07 08:36:02,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:02" (2/3) ... [2024-11-07 08:36:02,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564b2ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:36:02, skipping insertion in model container [2024-11-07 08:36:02,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:02" (3/3) ... [2024-11-07 08:36:02,986 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-82.i [2024-11-07 08:36:02,995 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:36:02,996 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:36:03,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:36:03,050 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;@7a19757, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:36:03,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:36:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 08:36:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 08:36:03,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:36:03,061 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:03,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:36:03,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:36:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1867853958, now seen corresponding path program 1 times [2024-11-07 08:36:03,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:36:03,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836111293] [2024-11-07 08:36:03,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:36:03,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:36:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:36:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:36:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:36:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 08:36:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:36:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:36:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 08:36:03,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:36:03,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836111293] [2024-11-07 08:36:03,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836111293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:36:03,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:36:03,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:36:03,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425581714] [2024-11-07 08:36:03,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:36:03,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:36:03,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:36:03,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:36:03,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:36:03,288 INFO L87 Difference]: Start difference. First operand has 45 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 08:36:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:36:03,306 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2024-11-07 08:36:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:36:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2024-11-07 08:36:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:36:03,312 INFO L225 Difference]: With dead ends: 79 [2024-11-07 08:36:03,312 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 08:36:03,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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 08:36:03,316 INFO L432 NwaCegarLoop]: 49 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, 49 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 08:36:03,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:36:03,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 08:36:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-07 08:36:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 08:36:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2024-11-07 08:36:03,338 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 50 [2024-11-07 08:36:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:36:03,338 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2024-11-07 08:36:03,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 08:36:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2024-11-07 08:36:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 08:36:03,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:36:03,340 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:03,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:36:03,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:36:03,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:36:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1260352138, now seen corresponding path program 1 times [2024-11-07 08:36:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:36:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660213553] [2024-11-07 08:36:03,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:36:03,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:36:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:36:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:36:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:36:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 08:36:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:36:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:36:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 08:36:03,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:36:03,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660213553] [2024-11-07 08:36:03,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660213553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:36:03,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:36:03,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:36:03,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836185491] [2024-11-07 08:36:03,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:36:03,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:36:03,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:36:03,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:36:03,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:36:03,620 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:36:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:36:03,686 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2024-11-07 08:36:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:36:03,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2024-11-07 08:36:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:36:03,687 INFO L225 Difference]: With dead ends: 87 [2024-11-07 08:36:03,687 INFO L226 Difference]: Without dead ends: 53 [2024-11-07 08:36:03,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:36:03,688 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:36:03,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 206 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:36:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-07 08:36:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2024-11-07 08:36:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 08:36:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2024-11-07 08:36:03,692 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 50 [2024-11-07 08:36:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:36:03,693 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2024-11-07 08:36:03,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:36:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2024-11-07 08:36:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 08:36:03,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:36:03,695 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:03,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:36:03,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:36:03,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:36:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash -851780271, now seen corresponding path program 1 times [2024-11-07 08:36:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:36:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635284273] [2024-11-07 08:36:03,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:36:03,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:36:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:36:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:36:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:36:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 08:36:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:36:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:36:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 08:36:04,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:36:04,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635284273] [2024-11-07 08:36:04,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635284273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:36:04,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:36:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:36:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358811269] [2024-11-07 08:36:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:36:04,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:36:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:36:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:36:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:36:04,186 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:36:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:36:04,332 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2024-11-07 08:36:04,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:36:04,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2024-11-07 08:36:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:36:04,334 INFO L225 Difference]: With dead ends: 97 [2024-11-07 08:36:04,334 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 08:36:04,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:36:04,335 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 65 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:36:04,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 250 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:36:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 08:36:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2024-11-07 08:36:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 66 states have internal predecessors, (82), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 08:36:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2024-11-07 08:36:04,344 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 52 [2024-11-07 08:36:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:36:04,345 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2024-11-07 08:36:04,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:36:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2024-11-07 08:36:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 08:36:04,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:36:04,346 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:04,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:36:04,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:36:04,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:36:04,347 INFO L85 PathProgramCache]: Analyzing trace with hash -593614833, now seen corresponding path program 1 times [2024-11-07 08:36:04,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:36:04,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803842950] [2024-11-07 08:36:04,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:36:04,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:36:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:36:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:36:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:36:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 08:36:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:36:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:36:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 08:36:04,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:36:04,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803842950] [2024-11-07 08:36:04,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803842950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:36:04,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:36:04,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:36:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763408021] [2024-11-07 08:36:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:36:04,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:36:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:36:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:36:04,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:36:04,553 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:36:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:36:04,714 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2024-11-07 08:36:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:36:04,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2024-11-07 08:36:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:36:04,717 INFO L225 Difference]: With dead ends: 199 [2024-11-07 08:36:04,717 INFO L226 Difference]: Without dead ends: 124 [2024-11-07 08:36:04,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:36:04,718 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 46 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:36:04,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 178 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:36:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-07 08:36:04,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 96. [2024-11-07 08:36:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 77 states have internal predecessors, (93), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:36:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2024-11-07 08:36:04,728 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 52 [2024-11-07 08:36:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:36:04,729 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2024-11-07 08:36:04,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:36:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2024-11-07 08:36:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 08:36:04,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:36:04,730 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:04,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:36:04,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:36:04,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:36:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1752114755, now seen corresponding path program 1 times [2024-11-07 08:36:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:36:04,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871692794] [2024-11-07 08:36:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:36:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:36:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:36:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:36:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:36:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 08:36:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:36:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:36:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 08:36:04,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:36:04,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871692794] [2024-11-07 08:36:04,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871692794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:36:04,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:36:04,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:36:04,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772240942] [2024-11-07 08:36:04,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:36:04,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:36:04,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:36:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:36:04,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:36:04,838 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:36:04,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:36:04,854 INFO L93 Difference]: Finished difference Result 156 states and 202 transitions. [2024-11-07 08:36:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:36:04,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2024-11-07 08:36:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:36:04,855 INFO L225 Difference]: With dead ends: 156 [2024-11-07 08:36:04,855 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 08:36:04,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:36:04,856 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:36:04,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:36:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 08:36:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-11-07 08:36:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:36:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2024-11-07 08:36:04,866 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 53 [2024-11-07 08:36:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:36:04,866 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2024-11-07 08:36:04,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:36:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2024-11-07 08:36:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 08:36:04,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:36:04,868 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:36:04,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:36:04,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:36:04,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:36:04,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1584688862, now seen corresponding path program 1 times [2024-11-07 08:36:04,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:36:04,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688946697] [2024-11-07 08:36:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:36:04,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:36:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:36:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:36:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:36:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 08:36:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:36:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:36:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:36:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:36:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:36:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:36:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:36:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:36:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-11-07 08:36:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:36:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688946697] [2024-11-07 08:36:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688946697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:36:05,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:36:05,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:36:05,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191128074] [2024-11-07 08:36:05,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:36:05,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:36:05,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:36:05,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:36:05,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:36:05,450 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:36:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:36:05,574 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2024-11-07 08:36:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:36:05,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 101 [2024-11-07 08:36:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:36:05,578 INFO L225 Difference]: With dead ends: 81 [2024-11-07 08:36:05,578 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 08:36:05,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:36:05,579 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 35 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:36:05,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 204 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:36:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 08:36:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 08:36:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 08:36:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 08:36:05,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2024-11-07 08:36:05,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:36:05,580 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 08:36:05,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:36:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 08:36:05,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 08:36:05,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:36:05,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:36:05,588 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 08:36:05,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 08:36:05,768 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:36:05,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:36:05 BoogieIcfgContainer [2024-11-07 08:36:05,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:36:05,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:36:05,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:36:05,795 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:36:05,796 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:02" (3/4) ... [2024-11-07 08:36:05,798 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 08:36:05,803 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 08:36:05,806 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-07 08:36:05,808 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 08:36:05,808 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 08:36:05,809 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 08:36:05,894 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 08:36:05,896 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 08:36:05,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:36:05,898 INFO L158 Benchmark]: Toolchain (without parser) took 3587.63ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 92.3MB in the beginning and 100.6MB in the end (delta: -8.3MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-07 08:36:05,899 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:36:05,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.30ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:36:05,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.45ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 77.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:36:05,900 INFO L158 Benchmark]: Boogie Preprocessor took 59.31ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:36:05,900 INFO L158 Benchmark]: RCFGBuilder took 293.71ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 60.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:36:05,901 INFO L158 Benchmark]: TraceAbstraction took 2813.07ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 60.2MB in the beginning and 105.3MB in the end (delta: -45.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-07 08:36:05,902 INFO L158 Benchmark]: Witness Printer took 100.94ms. Allocated memory is still 159.4MB. Free memory was 105.3MB in the beginning and 100.6MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:36:05,907 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.30ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.45ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 77.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.31ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 293.71ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 60.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2813.07ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 60.2MB in the beginning and 105.3MB in the end (delta: -45.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 100.94ms. Allocated memory is still 159.4MB. Free memory was 105.3MB in the beginning and 100.6MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 964 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 682 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 282 mSDtfsCounter, 244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 588/588 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: (((((long long) last_1_var_1_10 + 10) <= 0) && (((long long) var_1_10 + 10) <= 0)) || ((var_1_9 == var_1_5) && (var_1_9 == var_1_10))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (last_1_var_1_10 == \old(last_1_var_1_10))) RESULT: Ultimate proved your program to be correct! [2024-11-07 08:36:05,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE