./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-56.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-56.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', '93f6049834027826884500d547bca7113061f8754e944538b453474a4566d492'] 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-56.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 93f6049834027826884500d547bca7113061f8754e944538b453474a4566d492 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:33:07,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:33:07,289 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:33:07,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:33:07,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:33:07,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:33:07,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:33:07,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:33:07,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:33:07,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:33:07,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:33:07,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:33:07,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:33:07,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:33:07,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:33:07,322 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:33:07,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:33:07,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:33:07,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:33:07,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:33:07,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:33:07,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:33:07,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:33:07,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:33:07,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:33:07,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:33:07,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:33:07,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:33:07,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:33:07,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:33:07,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:33:07,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:33:07,326 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 -> 93f6049834027826884500d547bca7113061f8754e944538b453474a4566d492 [2024-11-07 08:33:07,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:33:07,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:33:07,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:33:07,605 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:33:07,606 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:33:07,607 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-56.i [2024-11-07 08:33:08,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:33:09,102 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:33:09,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-56.i [2024-11-07 08:33:09,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96d05da84/b8e1f4f91fac45e8907b78c28b3ee682/FLAG7445dda82 [2024-11-07 08:33:09,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96d05da84/b8e1f4f91fac45e8907b78c28b3ee682 [2024-11-07 08:33:09,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:33:09,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:33:09,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:33:09,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:33:09,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:33:09,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35af070e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09, skipping insertion in model container [2024-11-07 08:33:09,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:33:09,296 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-56.i[915,928] [2024-11-07 08:33:09,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:33:09,367 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:33:09,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_loopvsstraightlinecode_25-while_file-56.i[915,928] [2024-11-07 08:33:09,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:33:09,425 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:33:09,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09 WrapperNode [2024-11-07 08:33:09,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:33:09,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:33:09,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:33:09,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:33:09,433 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:33:09" (1/1) ... [2024-11-07 08:33:09,440 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:33:09" (1/1) ... [2024-11-07 08:33:09,482 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-07 08:33:09,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:33:09,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:33:09,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:33:09,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:33:09,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,528 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:33:09,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:33:09,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:33:09,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:33:09,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:33:09,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (1/1) ... [2024-11-07 08:33:09,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:33:09,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:33:09,580 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:33:09,584 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:33:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:33:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:33:09,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:33:09,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:33:09,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:33:09,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:33:09,691 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:33:09,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:33:10,010 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 08:33:10,010 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:33:10,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:33:10,023 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:33:10,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:33:10 BoogieIcfgContainer [2024-11-07 08:33:10,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:33:10,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:33:10,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:33:10,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:33:10,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:33:09" (1/3) ... [2024-11-07 08:33:10,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b74c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:33:10, skipping insertion in model container [2024-11-07 08:33:10,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:09" (2/3) ... [2024-11-07 08:33:10,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b74c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:33:10, skipping insertion in model container [2024-11-07 08:33:10,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:33:10" (3/3) ... [2024-11-07 08:33:10,038 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-56.i [2024-11-07 08:33:10,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:33:10,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:33:10,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:33:10,120 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;@7a30542c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:33:10,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:33:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 08:33:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 08:33:10,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:10,140 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:10,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:10,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash 514941654, now seen corresponding path program 1 times [2024-11-07 08:33:10,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089249235] [2024-11-07 08:33:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 08:33:10,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:10,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089249235] [2024-11-07 08:33:10,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089249235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:10,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:10,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:33:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136004920] [2024-11-07 08:33:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:10,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:33:10,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:10,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:33:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:33:10,501 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 08:33:10,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:10,521 INFO L93 Difference]: Finished difference Result 85 states and 134 transitions. [2024-11-07 08:33:10,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:33:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2024-11-07 08:33:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:10,530 INFO L225 Difference]: With dead ends: 85 [2024-11-07 08:33:10,531 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 08:33:10,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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:33:10,538 INFO L432 NwaCegarLoop]: 58 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, 58 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:33:10,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:33:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 08:33:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-07 08:33:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 08:33:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-07 08:33:10,574 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 72 [2024-11-07 08:33:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:10,575 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-07 08:33:10,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 08:33:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-07 08:33:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 08:33:10,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:10,578 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:10,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:33:10,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:10,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -436045418, now seen corresponding path program 1 times [2024-11-07 08:33:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:10,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987095296] [2024-11-07 08:33:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 08:33:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:11,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987095296] [2024-11-07 08:33:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987095296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:33:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337845737] [2024-11-07 08:33:11,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:11,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:33:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:11,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:33:11,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:33:11,312 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:11,539 INFO L93 Difference]: Finished difference Result 119 states and 167 transitions. [2024-11-07 08:33:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:33:11,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2024-11-07 08:33:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:11,542 INFO L225 Difference]: With dead ends: 119 [2024-11-07 08:33:11,542 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 08:33:11,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 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 08:33:11,544 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 36 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:11,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 165 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:33:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 08:33:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2024-11-07 08:33:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:33:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-11-07 08:33:11,561 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 72 [2024-11-07 08:33:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:11,561 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-11-07 08:33:11,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-11-07 08:33:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 08:33:11,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:11,563 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:11,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:33:11,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:11,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash 265019160, now seen corresponding path program 1 times [2024-11-07 08:33:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:11,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235863793] [2024-11-07 08:33:11,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:11,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 08:33:13,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235863793] [2024-11-07 08:33:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235863793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:13,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 08:33:13,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51167261] [2024-11-07 08:33:13,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:13,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 08:33:13,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:13,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 08:33:13,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:33:13,792 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:14,633 INFO L93 Difference]: Finished difference Result 108 states and 148 transitions. [2024-11-07 08:33:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:33:14,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2024-11-07 08:33:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:14,637 INFO L225 Difference]: With dead ends: 108 [2024-11-07 08:33:14,637 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 08:33:14,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:33:14,638 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 48 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:14,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 239 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:33:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 08:33:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2024-11-07 08:33:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:33:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-11-07 08:33:14,659 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 72 [2024-11-07 08:33:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:14,660 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-11-07 08:33:14,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-11-07 08:33:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 08:33:14,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:14,662 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:14,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:33:14,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:14,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:14,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1403394695, now seen corresponding path program 1 times [2024-11-07 08:33:14,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:14,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125512291] [2024-11-07 08:33:14,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:14,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 08:33:16,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:16,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125512291] [2024-11-07 08:33:16,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125512291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:16,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:16,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 08:33:16,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911004873] [2024-11-07 08:33:16,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:16,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:33:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:16,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:33:16,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:33:16,842 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:17,562 INFO L93 Difference]: Finished difference Result 122 states and 167 transitions. [2024-11-07 08:33:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:33:17,562 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2024-11-07 08:33:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:17,564 INFO L225 Difference]: With dead ends: 122 [2024-11-07 08:33:17,564 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 08:33:17,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:33:17,565 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 27 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:17,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 283 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 08:33:17,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 08:33:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 91. [2024-11-07 08:33:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:33:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-07 08:33:17,583 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 73 [2024-11-07 08:33:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:17,584 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-07 08:33:17,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-07 08:33:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 08:33:17,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:17,586 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:17,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:33:17,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:17,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:17,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2083453065, now seen corresponding path program 1 times [2024-11-07 08:33:17,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:17,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497012674] [2024-11-07 08:33:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 08:33:19,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:19,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497012674] [2024-11-07 08:33:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497012674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:19,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:19,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 08:33:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790738061] [2024-11-07 08:33:19,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:19,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:33:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:19,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:33:19,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:33:19,612 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:20,952 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions. [2024-11-07 08:33:20,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:33:20,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2024-11-07 08:33:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:20,954 INFO L225 Difference]: With dead ends: 120 [2024-11-07 08:33:20,954 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 08:33:20,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:33:20,955 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 34 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:20,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 288 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 08:33:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 08:33:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 86. [2024-11-07 08:33:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 states have internal predecessors, (81), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:33:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2024-11-07 08:33:20,972 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 73 [2024-11-07 08:33:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:20,975 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2024-11-07 08:33:20,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2024-11-07 08:33:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 08:33:20,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:20,977 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:33:20,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:33:20,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:20,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash -226296450, now seen corresponding path program 1 times [2024-11-07 08:33:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:20,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942766941] [2024-11-07 08:33:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:20,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 08:33:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:33:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 08:33:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 08:33:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 08:33:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:33:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:33:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:33:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:33:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:33:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-07 08:33:25,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942766941] [2024-11-07 08:33:25,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942766941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:25,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:25,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 08:33:25,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182302587] [2024-11-07 08:33:25,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:25,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 08:33:25,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 08:33:25,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:33:25,091 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:26,346 INFO L93 Difference]: Finished difference Result 120 states and 163 transitions. [2024-11-07 08:33:26,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:33:26,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 141 [2024-11-07 08:33:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:26,348 INFO L225 Difference]: With dead ends: 120 [2024-11-07 08:33:26,348 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 08:33:26,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:33:26,349 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 48 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:26,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 293 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 08:33:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 08:33:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 93. [2024-11-07 08:33:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:33:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-11-07 08:33:26,364 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 141 [2024-11-07 08:33:26,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:26,364 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-11-07 08:33:26,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-11-07 08:33:26,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 08:33:26,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:26,370 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:33:26,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:33:26,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:26,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash -942487327, now seen corresponding path program 1 times [2024-11-07 08:33:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600396328] [2024-11-07 08:33:26,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 08:33:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:33:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 08:33:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 08:33:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 08:33:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:33:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:33:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:33:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:33:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:33:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-07 08:33:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600396328] [2024-11-07 08:33:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600396328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:29,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:29,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 08:33:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266081142] [2024-11-07 08:33:29,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:29,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:33:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:29,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:33:29,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:33:29,281 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:31,095 INFO L93 Difference]: Finished difference Result 128 states and 174 transitions. [2024-11-07 08:33:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:33:31,095 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 142 [2024-11-07 08:33:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:31,097 INFO L225 Difference]: With dead ends: 128 [2024-11-07 08:33:31,097 INFO L226 Difference]: Without dead ends: 126 [2024-11-07 08:33:31,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:33:31,098 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 32 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:31,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 358 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 08:33:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-07 08:33:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 94. [2024-11-07 08:33:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:33:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-07 08:33:31,106 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 142 [2024-11-07 08:33:31,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:31,106 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-07 08:33:31,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-07 08:33:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 08:33:31,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:31,108 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:33:31,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:33:31,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:31,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash -262428957, now seen corresponding path program 1 times [2024-11-07 08:33:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993831230] [2024-11-07 08:33:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 08:33:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:33:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 08:33:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 08:33:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 08:33:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:33:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:33:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:33:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:33:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:33:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-07 08:33:32,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:32,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993831230] [2024-11-07 08:33:32,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993831230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:32,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:32,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 08:33:32,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232419209] [2024-11-07 08:33:32,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:32,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 08:33:32,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:32,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 08:33:32,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:33:32,632 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:33,990 INFO L93 Difference]: Finished difference Result 127 states and 172 transitions. [2024-11-07 08:33:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:33:33,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 142 [2024-11-07 08:33:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:33,993 INFO L225 Difference]: With dead ends: 127 [2024-11-07 08:33:33,993 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 08:33:33,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:33:33,994 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 46 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:33,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 356 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 08:33:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 08:33:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2024-11-07 08:33:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:33:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-07 08:33:34,010 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 142 [2024-11-07 08:33:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:34,011 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-07 08:33:34,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-07 08:33:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 08:33:34,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:34,012 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:33:34,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 08:33:34,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:34,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1630093461, now seen corresponding path program 1 times [2024-11-07 08:33:34,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:34,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594012014] [2024-11-07 08:33:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:34,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 08:33:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:33:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 08:33:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 08:33:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 08:33:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:33:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:33:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:33:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:33:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:33:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-07 08:33:34,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:34,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594012014] [2024-11-07 08:33:34,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594012014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:34,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:34,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:33:34,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779635] [2024-11-07 08:33:34,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:34,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:33:34,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:34,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:33:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:33:34,132 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:34,164 INFO L93 Difference]: Finished difference Result 168 states and 240 transitions. [2024-11-07 08:33:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:33:34,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 142 [2024-11-07 08:33:34,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:34,166 INFO L225 Difference]: With dead ends: 168 [2024-11-07 08:33:34,166 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 08:33:34,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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:33:34,168 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:34,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 96 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:33:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 08:33:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 85. [2024-11-07 08:33:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:33:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2024-11-07 08:33:34,181 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 142 [2024-11-07 08:33:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:34,182 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2024-11-07 08:33:34,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2024-11-07 08:33:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 08:33:34,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:34,184 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:33:34,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 08:33:34,184 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:34,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1690481293, now seen corresponding path program 1 times [2024-11-07 08:33:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:34,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753015911] [2024-11-07 08:33:34,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 08:33:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:33:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 08:33:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 08:33:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 08:33:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:33:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:33:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:33:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:33:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:33:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-07 08:33:34,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:34,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753015911] [2024-11-07 08:33:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753015911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:34,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:34,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:33:34,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074674116] [2024-11-07 08:33:34,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:34,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:33:34,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:34,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:33:34,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:33:34,294 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:34,321 INFO L93 Difference]: Finished difference Result 146 states and 207 transitions. [2024-11-07 08:33:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:33:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 142 [2024-11-07 08:33:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:34,324 INFO L225 Difference]: With dead ends: 146 [2024-11-07 08:33:34,324 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 08:33:34,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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:33:34,325 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:34,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 112 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:33:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 08:33:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2024-11-07 08:33:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:33:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2024-11-07 08:33:34,337 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 142 [2024-11-07 08:33:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:34,337 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2024-11-07 08:33:34,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 08:33:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2024-11-07 08:33:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 08:33:34,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:34,339 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:33:34,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 08:33:34,339 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:34,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash 662495912, now seen corresponding path program 1 times [2024-11-07 08:33:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744958176] [2024-11-07 08:33:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 08:33:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:33:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 08:33:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 08:33:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 08:33:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:33:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:33:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:33:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:33:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:33:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-07 08:33:34,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:34,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744958176] [2024-11-07 08:33:34,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744958176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:33:34,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490911335] [2024-11-07 08:33:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:34,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:33:34,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:33:34,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:33:34,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:33:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:34,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:33:34,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:33:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 9 proven. 418 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-07 08:33:34,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:33:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-07 08:33:35,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490911335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:33:35,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:33:35,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2024-11-07 08:33:35,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041230730] [2024-11-07 08:33:35,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:33:35,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:33:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:35,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:33:35,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:33:35,059 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2024-11-07 08:33:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:35,118 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2024-11-07 08:33:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:33:35,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) Word has length 143 [2024-11-07 08:33:35,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:35,121 INFO L225 Difference]: With dead ends: 173 [2024-11-07 08:33:35,121 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 08:33:35,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:33:35,122 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:35,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 238 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:33:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 08:33:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2024-11-07 08:33:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 78 states have internal predecessors, (95), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:33:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2024-11-07 08:33:35,130 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 143 [2024-11-07 08:33:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:35,130 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2024-11-07 08:33:35,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2024-11-07 08:33:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2024-11-07 08:33:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 08:33:35,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:35,132 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:33:35,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:33:35,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 08:33:35,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:35,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1081521241, now seen corresponding path program 1 times [2024-11-07 08:33:35,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:35,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511961512] [2024-11-07 08:33:35,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:35,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:33:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:33:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:33:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:33:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 08:33:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 08:33:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 08:33:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 08:33:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 08:33:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 08:33:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 08:33:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:33:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 08:33:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 08:33:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 51 proven. 123 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2024-11-07 08:33:35,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:35,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511961512] [2024-11-07 08:33:35,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511961512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:33:35,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167195963] [2024-11-07 08:33:35,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:35,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:33:35,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:33:35,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:33:35,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 08:33:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:36,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 08:33:36,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:33:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 543 proven. 24 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-07 08:33:36,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:33:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167195963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:33:36,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:33:36,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 18 [2024-11-07 08:33:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040153612] [2024-11-07 08:33:36,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:33:36,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 08:33:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:36,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 08:33:36,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-11-07 08:33:36,763 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 16 states have internal predecessors, (65), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2024-11-07 08:33:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:37,085 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2024-11-07 08:33:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 08:33:37,085 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 16 states have internal predecessors, (65), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 144 [2024-11-07 08:33:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:37,086 INFO L225 Difference]: With dead ends: 182 [2024-11-07 08:33:37,086 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 08:33:37,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2024-11-07 08:33:37,089 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 95 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:37,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 159 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:33:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 08:33:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 08:33:37,090 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:33:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 08:33:37,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2024-11-07 08:33:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:37,090 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 08:33:37,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 16 states have internal predecessors, (65), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2024-11-07 08:33:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 08:33:37,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 08:33:37,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:33:37,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 08:33:37,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:33:37,297 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:33:37,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 08:33:37,825 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:33:37,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:33:37 BoogieIcfgContainer [2024-11-07 08:33:37,845 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:33:37,847 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:33:37,847 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:33:37,847 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:33:37,848 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:33:10" (3/4) ... [2024-11-07 08:33:37,849 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 08:33:37,855 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 08:33:37,858 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-07 08:33:37,860 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 08:33:37,860 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 08:33:37,860 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 08:33:37,934 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 08:33:37,934 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 08:33:37,934 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:33:37,935 INFO L158 Benchmark]: Toolchain (without parser) took 28793.93ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 84.8MB in the beginning and 173.7MB in the end (delta: -88.8MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2024-11-07 08:33:37,935 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:33:37,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.61ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 72.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:33:37,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.93ms. Allocated memory is still 109.1MB. Free memory was 72.2MB in the beginning and 69.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:33:37,936 INFO L158 Benchmark]: Boogie Preprocessor took 59.65ms. Allocated memory is still 109.1MB. Free memory was 69.4MB in the beginning and 65.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:33:37,936 INFO L158 Benchmark]: RCFGBuilder took 476.76ms. Allocated memory is still 109.1MB. Free memory was 65.0MB in the beginning and 48.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:33:37,936 INFO L158 Benchmark]: TraceAbstraction took 27818.60ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 47.8MB in the beginning and 178.7MB in the end (delta: -130.9MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2024-11-07 08:33:37,937 INFO L158 Benchmark]: Witness Printer took 87.66ms. Allocated memory is still 293.6MB. Free memory was 178.7MB in the beginning and 173.7MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:33:37,938 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.91ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.61ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 72.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.93ms. Allocated memory is still 109.1MB. Free memory was 72.2MB in the beginning and 69.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.65ms. Allocated memory is still 109.1MB. Free memory was 69.4MB in the beginning and 65.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 476.76ms. Allocated memory is still 109.1MB. Free memory was 65.0MB in the beginning and 48.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27818.60ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 47.8MB in the beginning and 178.7MB in the end (delta: -130.9MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * Witness Printer took 87.66ms. Allocated memory is still 293.6MB. Free memory was 178.7MB in the beginning and 173.7MB in the end (delta: 5.0MB). 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, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 441 mSDsluCounter, 2645 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2001 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1891 IncrementalHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 644 mSDtfsCounter, 1891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1031 GetRequests, 929 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=11, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 215 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 1645 NumberOfCodeBlocks, 1645 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1773 ConstructedInterpolants, 0 QuantifiedInterpolants, 8154 SizeOfPredicates, 6 NumberOfNonLiveVariables, 643 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 8180/8780 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: 85]: Loop Invariant Derived loop invariant: ((((((1073741823 <= var_1_10) && (var_1_11 == 0)) && (127 <= var_1_5)) && (last_1_var_1_11 == 0)) && (var_1_5 <= 254)) && (var_1_10 <= 2147483647)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_11 == 0) && (last_1_var_1_11 == 0)) Ensures: ((((cond != 0) && (var_1_11 == 0)) && (last_1_var_1_11 == 0)) && ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (last_1_var_1_1 == \old(last_1_var_1_1))) && (last_1_var_1_11 == \old(last_1_var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 08:33:38,006 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