./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/systemc/token_ring.01.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f'] 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/systemc/token_ring.01.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:59:42,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:59:42,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 20:59:42,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:59:42,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:59:42,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:59:42,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:59:42,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:59:42,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:59:42,409 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:59:42,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:59:42,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:59:42,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:59:42,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:59:42,410 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:59:42,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:59:42,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:59:42,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:59:42,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:59:42,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:59:42,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:59:42,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:59:42,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:59:42,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:59:42,411 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:59:42,411 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:59:42,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:59:42,412 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:59:42,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:59:42,412 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:59:42,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:59:42,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:59:42,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:59:42,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:59:42,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:59:42,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:59:42,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:59:42,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:59:42,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:59:42,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:59:42,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:59:42,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:59:42,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:59:42,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:59:42,413 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 ! overflow) ) 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2024-11-07 20:59:42,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:59:42,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:59:42,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:59:42,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:59:42,677 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:59:42,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2024-11-07 20:59:43,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:59:44,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:59:44,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2024-11-07 20:59:44,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c861939b/5522fc7f66a642f192bc66fb1d1951a3/FLAG593d78695 [2024-11-07 20:59:44,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c861939b/5522fc7f66a642f192bc66fb1d1951a3 [2024-11-07 20:59:44,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:59:44,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:59:44,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:59:44,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:59:44,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:59:44,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c4d105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44, skipping insertion in model container [2024-11-07 20:59:44,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:59:44,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:59:44,442 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:59:44,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:59:44,494 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:59:44,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44 WrapperNode [2024-11-07 20:59:44,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:59:44,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:59:44,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:59:44,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:59:44,500 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:59:44" (1/1) ... [2024-11-07 20:59:44,507 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:59:44" (1/1) ... [2024-11-07 20:59:44,526 INFO L138 Inliner]: procedures = 30, calls = 36, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 234 [2024-11-07 20:59:44,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:59:44,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:59:44,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:59:44,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:59:44,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,547 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 20:59:44,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:59:44,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:59:44,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:59:44,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:59:44,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (1/1) ... [2024-11-07 20:59:44,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:59:44,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:59:44,590 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 20:59:44,593 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 20:59:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:59:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 20:59:44,615 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 20:59:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 20:59:44,615 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 20:59:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 20:59:44,615 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 20:59:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 20:59:44,615 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 20:59:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 20:59:44,615 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 20:59:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 20:59:44,615 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 20:59:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:59:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 20:59:44,616 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 20:59:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:59:44,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:59:44,670 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:59:44,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:59:44,924 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-07 20:59:44,924 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:59:44,935 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:59:44,935 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-07 20:59:44,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:44 BoogieIcfgContainer [2024-11-07 20:59:44,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:59:44,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:59:44,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:59:44,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:59:44,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:59:44" (1/3) ... [2024-11-07 20:59:44,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b382a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:59:44, skipping insertion in model container [2024-11-07 20:59:44,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:44" (2/3) ... [2024-11-07 20:59:44,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b382a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:59:44, skipping insertion in model container [2024-11-07 20:59:44,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:44" (3/3) ... [2024-11-07 20:59:44,945 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2024-11-07 20:59:44,956 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:59:44,956 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 20:59:45,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:59:45,027 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;@973c944, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:59:45,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 20:59:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 102 states have internal predecessors, (147), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 20:59:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 20:59:45,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:45,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:45,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:45,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:45,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1551110128, now seen corresponding path program 1 times [2024-11-07 20:59:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:45,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951579675] [2024-11-07 20:59:45,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:45,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:45,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:45,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:45,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:45,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951579675] [2024-11-07 20:59:45,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951579675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:45,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:45,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 20:59:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97557798] [2024-11-07 20:59:45,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:45,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:59:45,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:45,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:59:45,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:59:45,528 INFO L87 Difference]: Start difference. First operand has 124 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 102 states have internal predecessors, (147), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:46,222 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2024-11-07 20:59:46,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 20:59:46,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-07 20:59:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:46,234 INFO L225 Difference]: With dead ends: 386 [2024-11-07 20:59:46,234 INFO L226 Difference]: Without dead ends: 257 [2024-11-07 20:59:46,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 20:59:46,241 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 321 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:46,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 477 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 20:59:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-07 20:59:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 214. [2024-11-07 20:59:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 172 states have (on average 1.4651162790697674) internal successors, (252), 177 states have internal predecessors, (252), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-07 20:59:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 305 transitions. [2024-11-07 20:59:46,324 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 305 transitions. Word has length 55 [2024-11-07 20:59:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:46,324 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 305 transitions. [2024-11-07 20:59:46,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 305 transitions. [2024-11-07 20:59:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 20:59:46,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:46,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:46,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:59:46,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:46,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:46,327 INFO L85 PathProgramCache]: Analyzing trace with hash 913324044, now seen corresponding path program 1 times [2024-11-07 20:59:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:46,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009840216] [2024-11-07 20:59:46,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:46,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:46,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:46,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:46,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:46,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009840216] [2024-11-07 20:59:46,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009840216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:46,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:46,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 20:59:46,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013682927] [2024-11-07 20:59:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:46,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 20:59:46,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 20:59:46,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:46,561 INFO L87 Difference]: Start difference. First operand 214 states and 305 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:47,321 INFO L93 Difference]: Finished difference Result 580 states and 828 transitions. [2024-11-07 20:59:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 20:59:47,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-07 20:59:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:47,325 INFO L225 Difference]: With dead ends: 580 [2024-11-07 20:59:47,325 INFO L226 Difference]: Without dead ends: 375 [2024-11-07 20:59:47,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 20:59:47,327 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 302 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:47,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 799 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 20:59:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-07 20:59:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 309. [2024-11-07 20:59:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 250 states have (on average 1.456) internal successors, (364), 256 states have internal predecessors, (364), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-11-07 20:59:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 439 transitions. [2024-11-07 20:59:47,364 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 439 transitions. Word has length 55 [2024-11-07 20:59:47,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:47,364 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 439 transitions. [2024-11-07 20:59:47,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 439 transitions. [2024-11-07 20:59:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 20:59:47,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:47,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:47,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:59:47,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:47,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash 15930766, now seen corresponding path program 1 times [2024-11-07 20:59:47,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:47,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135279008] [2024-11-07 20:59:47,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:47,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:47,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:47,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135279008] [2024-11-07 20:59:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135279008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:47,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:47,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 20:59:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685531943] [2024-11-07 20:59:47,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:47,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 20:59:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 20:59:47,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:47,514 INFO L87 Difference]: Start difference. First operand 309 states and 439 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:48,244 INFO L93 Difference]: Finished difference Result 946 states and 1346 transitions. [2024-11-07 20:59:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 20:59:48,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-07 20:59:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:48,249 INFO L225 Difference]: With dead ends: 946 [2024-11-07 20:59:48,249 INFO L226 Difference]: Without dead ends: 646 [2024-11-07 20:59:48,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 20:59:48,251 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 357 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:48,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 787 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 20:59:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-07 20:59:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 492. [2024-11-07 20:59:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 401 states have (on average 1.4438902743142146) internal successors, (579), 409 states have internal predecessors, (579), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-07 20:59:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 698 transitions. [2024-11-07 20:59:48,300 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 698 transitions. Word has length 55 [2024-11-07 20:59:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:48,300 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 698 transitions. [2024-11-07 20:59:48,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 698 transitions. [2024-11-07 20:59:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 20:59:48,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:48,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:48,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:59:48,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:48,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash 264077260, now seen corresponding path program 1 times [2024-11-07 20:59:48,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:48,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732972703] [2024-11-07 20:59:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:48,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:48,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:48,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:48,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732972703] [2024-11-07 20:59:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732972703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 20:59:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319806740] [2024-11-07 20:59:48,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:48,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 20:59:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:48,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 20:59:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:48,434 INFO L87 Difference]: Start difference. First operand 492 states and 698 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:49,173 INFO L93 Difference]: Finished difference Result 1522 states and 2161 transitions. [2024-11-07 20:59:49,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 20:59:49,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-07 20:59:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:49,182 INFO L225 Difference]: With dead ends: 1522 [2024-11-07 20:59:49,183 INFO L226 Difference]: Without dead ends: 1039 [2024-11-07 20:59:49,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 20:59:49,185 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 297 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:49,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 757 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 20:59:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-11-07 20:59:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 801. [2024-11-07 20:59:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 652 states have (on average 1.4248466257668713) internal successors, (929), 664 states have internal predecessors, (929), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2024-11-07 20:59:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1134 transitions. [2024-11-07 20:59:49,251 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1134 transitions. Word has length 55 [2024-11-07 20:59:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:49,251 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1134 transitions. [2024-11-07 20:59:49,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1134 transitions. [2024-11-07 20:59:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 20:59:49,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:49,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:49,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:59:49,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:49,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash 687723982, now seen corresponding path program 1 times [2024-11-07 20:59:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:49,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301227806] [2024-11-07 20:59:49,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:49,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:49,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:49,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:49,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:49,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301227806] [2024-11-07 20:59:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301227806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:49,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:49,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 20:59:49,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689731195] [2024-11-07 20:59:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:49,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:59:49,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:49,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:59:49,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:59:49,336 INFO L87 Difference]: Start difference. First operand 801 states and 1134 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:49,932 INFO L93 Difference]: Finished difference Result 2213 states and 3139 transitions. [2024-11-07 20:59:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 20:59:49,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-07 20:59:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:49,940 INFO L225 Difference]: With dead ends: 2213 [2024-11-07 20:59:49,940 INFO L226 Difference]: Without dead ends: 1422 [2024-11-07 20:59:49,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 20:59:49,944 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 420 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:49,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 538 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 20:59:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2024-11-07 20:59:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1215. [2024-11-07 20:59:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 983 states have (on average 1.397761953204476) internal successors, (1374), 1004 states have internal predecessors, (1374), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-11-07 20:59:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1687 transitions. [2024-11-07 20:59:50,076 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1687 transitions. Word has length 55 [2024-11-07 20:59:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:50,076 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1687 transitions. [2024-11-07 20:59:50,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1687 transitions. [2024-11-07 20:59:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 20:59:50,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:50,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:50,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:59:50,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:50,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash -987112854, now seen corresponding path program 1 times [2024-11-07 20:59:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:50,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208269499] [2024-11-07 20:59:50,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:50,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:50,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208269499] [2024-11-07 20:59:50,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208269499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:50,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:50,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 20:59:50,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348226456] [2024-11-07 20:59:50,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:50,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 20:59:50,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:50,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 20:59:50,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:50,221 INFO L87 Difference]: Start difference. First operand 1215 states and 1687 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:50,643 INFO L93 Difference]: Finished difference Result 2572 states and 3617 transitions. [2024-11-07 20:59:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 20:59:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-07 20:59:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:50,651 INFO L225 Difference]: With dead ends: 2572 [2024-11-07 20:59:50,651 INFO L226 Difference]: Without dead ends: 1367 [2024-11-07 20:59:50,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 20:59:50,655 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 109 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:50,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 542 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:59:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-11-07 20:59:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1230. [2024-11-07 20:59:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 998 states have (on average 1.3827655310621243) internal successors, (1380), 1019 states have internal predecessors, (1380), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-11-07 20:59:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1693 transitions. [2024-11-07 20:59:50,741 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1693 transitions. Word has length 56 [2024-11-07 20:59:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:50,742 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1693 transitions. [2024-11-07 20:59:50,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1693 transitions. [2024-11-07 20:59:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 20:59:50,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:50,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:50,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 20:59:50,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:50,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1059499412, now seen corresponding path program 1 times [2024-11-07 20:59:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445190580] [2024-11-07 20:59:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445190580] [2024-11-07 20:59:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445190580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:50,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 20:59:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630992769] [2024-11-07 20:59:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:50,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 20:59:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:50,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 20:59:50,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:50,855 INFO L87 Difference]: Start difference. First operand 1230 states and 1693 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:51,278 INFO L93 Difference]: Finished difference Result 2644 states and 3685 transitions. [2024-11-07 20:59:51,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 20:59:51,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-07 20:59:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:51,287 INFO L225 Difference]: With dead ends: 2644 [2024-11-07 20:59:51,288 INFO L226 Difference]: Without dead ends: 1424 [2024-11-07 20:59:51,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 20:59:51,291 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 114 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:51,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 537 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:59:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2024-11-07 20:59:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1272. [2024-11-07 20:59:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1040 states have (on average 1.3673076923076923) internal successors, (1422), 1061 states have internal predecessors, (1422), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-11-07 20:59:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1735 transitions. [2024-11-07 20:59:51,375 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1735 transitions. Word has length 56 [2024-11-07 20:59:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:51,375 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1735 transitions. [2024-11-07 20:59:51,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1735 transitions. [2024-11-07 20:59:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 20:59:51,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:51,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:51,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 20:59:51,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:51,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash 863728622, now seen corresponding path program 1 times [2024-11-07 20:59:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295101171] [2024-11-07 20:59:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:51,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:51,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:51,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:51,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:51,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295101171] [2024-11-07 20:59:51,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295101171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:51,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 20:59:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849731525] [2024-11-07 20:59:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:51,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 20:59:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 20:59:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:59:51,500 INFO L87 Difference]: Start difference. First operand 1272 states and 1735 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:52,118 INFO L93 Difference]: Finished difference Result 1838 states and 2509 transitions. [2024-11-07 20:59:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 20:59:52,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-07 20:59:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:52,126 INFO L225 Difference]: With dead ends: 1838 [2024-11-07 20:59:52,126 INFO L226 Difference]: Without dead ends: 1088 [2024-11-07 20:59:52,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-07 20:59:52,129 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 374 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:52,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 588 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 20:59:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-11-07 20:59:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 918. [2024-11-07 20:59:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 749 states have (on average 1.356475300400534) internal successors, (1016), 763 states have internal predecessors, (1016), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2024-11-07 20:59:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1231 transitions. [2024-11-07 20:59:52,184 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1231 transitions. Word has length 56 [2024-11-07 20:59:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:52,185 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1231 transitions. [2024-11-07 20:59:52,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1231 transitions. [2024-11-07 20:59:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 20:59:52,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:52,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:52,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 20:59:52,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:52,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1082583340, now seen corresponding path program 1 times [2024-11-07 20:59:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:52,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515106653] [2024-11-07 20:59:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:52,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:52,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:52,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:52,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515106653] [2024-11-07 20:59:52,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515106653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:52,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:52,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 20:59:52,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801821691] [2024-11-07 20:59:52,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:52,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 20:59:52,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:52,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 20:59:52,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:59:52,320 INFO L87 Difference]: Start difference. First operand 918 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:52,958 INFO L93 Difference]: Finished difference Result 1779 states and 2393 transitions. [2024-11-07 20:59:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 20:59:52,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-07 20:59:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:52,965 INFO L225 Difference]: With dead ends: 1779 [2024-11-07 20:59:52,965 INFO L226 Difference]: Without dead ends: 1116 [2024-11-07 20:59:52,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-07 20:59:52,969 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 371 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:52,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 583 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 20:59:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-07 20:59:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 912. [2024-11-07 20:59:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 745 states have (on average 1.3516778523489932) internal successors, (1007), 757 states have internal predecessors, (1007), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2024-11-07 20:59:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1214 transitions. [2024-11-07 20:59:53,022 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1214 transitions. Word has length 56 [2024-11-07 20:59:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:53,022 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1214 transitions. [2024-11-07 20:59:53,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1214 transitions. [2024-11-07 20:59:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 20:59:53,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:53,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:53,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 20:59:53,025 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:53,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:53,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1505285166, now seen corresponding path program 1 times [2024-11-07 20:59:53,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:53,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272363774] [2024-11-07 20:59:53,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:53,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:53,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:53,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272363774] [2024-11-07 20:59:53,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272363774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:53,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:53,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 20:59:53,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993438288] [2024-11-07 20:59:53,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:53,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 20:59:53,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:53,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 20:59:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:59:53,157 INFO L87 Difference]: Start difference. First operand 912 states and 1214 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:53,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:53,763 INFO L93 Difference]: Finished difference Result 1721 states and 2289 transitions. [2024-11-07 20:59:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 20:59:53,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-07 20:59:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:53,769 INFO L225 Difference]: With dead ends: 1721 [2024-11-07 20:59:53,770 INFO L226 Difference]: Without dead ends: 968 [2024-11-07 20:59:53,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-07 20:59:53,774 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 333 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:53,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 624 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 20:59:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-11-07 20:59:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 796. [2024-11-07 20:59:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 654 states have (on average 1.348623853211009) internal successors, (882), 664 states have internal predecessors, (882), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-07 20:59:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1054 transitions. [2024-11-07 20:59:53,844 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1054 transitions. Word has length 56 [2024-11-07 20:59:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:53,845 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1054 transitions. [2024-11-07 20:59:53,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1054 transitions. [2024-11-07 20:59:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 20:59:53,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:53,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:53,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 20:59:53,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:53,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash 687636716, now seen corresponding path program 1 times [2024-11-07 20:59:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772182771] [2024-11-07 20:59:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:53,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:53,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772182771] [2024-11-07 20:59:53,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772182771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:53,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:53,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 20:59:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210596392] [2024-11-07 20:59:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:53,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:59:53,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:53,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:59:53,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:59:53,933 INFO L87 Difference]: Start difference. First operand 796 states and 1054 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:54,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:54,395 INFO L93 Difference]: Finished difference Result 2454 states and 3298 transitions. [2024-11-07 20:59:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 20:59:54,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-07 20:59:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:54,404 INFO L225 Difference]: With dead ends: 2454 [2024-11-07 20:59:54,404 INFO L226 Difference]: Without dead ends: 1669 [2024-11-07 20:59:54,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 20:59:54,407 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 333 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:54,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 463 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:59:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-11-07 20:59:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1495. [2024-11-07 20:59:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1225 states have (on average 1.3273469387755101) internal successors, (1626), 1242 states have internal predecessors, (1626), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2024-11-07 20:59:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1985 transitions. [2024-11-07 20:59:54,498 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1985 transitions. Word has length 56 [2024-11-07 20:59:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:54,499 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 1985 transitions. [2024-11-07 20:59:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1985 transitions. [2024-11-07 20:59:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 20:59:54,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:54,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:54,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 20:59:54,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:54,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1414703249, now seen corresponding path program 1 times [2024-11-07 20:59:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:54,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241426000] [2024-11-07 20:59:54,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:54,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:54,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:54,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:54,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:54,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241426000] [2024-11-07 20:59:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241426000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:59:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492797740] [2024-11-07 20:59:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:54,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:59:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:59:54,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:54,545 INFO L87 Difference]: Start difference. First operand 1495 states and 1985 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:54,868 INFO L93 Difference]: Finished difference Result 2879 states and 3805 transitions. [2024-11-07 20:59:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:59:54,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-07 20:59:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:54,878 INFO L225 Difference]: With dead ends: 2879 [2024-11-07 20:59:54,879 INFO L226 Difference]: Without dead ends: 1395 [2024-11-07 20:59:54,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:59:54,883 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 277 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:54,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 247 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:59:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2024-11-07 20:59:54,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1218. [2024-11-07 20:59:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1004 states have (on average 1.3197211155378485) internal successors, (1325), 1019 states have internal predecessors, (1325), 122 states have call successors, (122), 78 states have call predecessors, (122), 88 states have return successors, (152), 121 states have call predecessors, (152), 122 states have call successors, (152) [2024-11-07 20:59:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1599 transitions. [2024-11-07 20:59:54,966 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1599 transitions. Word has length 57 [2024-11-07 20:59:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:54,966 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1599 transitions. [2024-11-07 20:59:54,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 20:59:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1599 transitions. [2024-11-07 20:59:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 20:59:54,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:54,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:54,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 20:59:54,969 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:54,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash 375464921, now seen corresponding path program 1 times [2024-11-07 20:59:54,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036329807] [2024-11-07 20:59:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036329807] [2024-11-07 20:59:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036329807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:55,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:59:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513563355] [2024-11-07 20:59:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:55,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:59:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:55,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:59:55,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:55,026 INFO L87 Difference]: Start difference. First operand 1218 states and 1599 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 20:59:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:55,471 INFO L93 Difference]: Finished difference Result 3492 states and 4608 transitions. [2024-11-07 20:59:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 20:59:55,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2024-11-07 20:59:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:55,482 INFO L225 Difference]: With dead ends: 3492 [2024-11-07 20:59:55,482 INFO L226 Difference]: Without dead ends: 2284 [2024-11-07 20:59:55,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:59:55,487 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 329 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:55,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 394 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:59:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2024-11-07 20:59:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 1992. [2024-11-07 20:59:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1640 states have (on average 1.302439024390244) internal successors, (2136), 1664 states have internal predecessors, (2136), 200 states have call successors, (200), 132 states have call predecessors, (200), 148 states have return successors, (249), 196 states have call predecessors, (249), 200 states have call successors, (249) [2024-11-07 20:59:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2585 transitions. [2024-11-07 20:59:55,624 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2585 transitions. Word has length 58 [2024-11-07 20:59:55,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:55,625 INFO L471 AbstractCegarLoop]: Abstraction has 1992 states and 2585 transitions. [2024-11-07 20:59:55,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 20:59:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2585 transitions. [2024-11-07 20:59:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 20:59:55,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:55,627 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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 20:59:55,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 20:59:55,627 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:55,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash -163397292, now seen corresponding path program 1 times [2024-11-07 20:59:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:55,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707132197] [2024-11-07 20:59:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 20:59:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 20:59:55,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:55,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707132197] [2024-11-07 20:59:55,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707132197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:55,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:55,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 20:59:55,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893606053] [2024-11-07 20:59:55,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:55,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:59:55,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:55,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:59:55,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:59:55,702 INFO L87 Difference]: Start difference. First operand 1992 states and 2585 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 20:59:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:56,627 INFO L93 Difference]: Finished difference Result 6324 states and 8267 transitions. [2024-11-07 20:59:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 20:59:56,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 77 [2024-11-07 20:59:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:56,650 INFO L225 Difference]: With dead ends: 6324 [2024-11-07 20:59:56,651 INFO L226 Difference]: Without dead ends: 4343 [2024-11-07 20:59:56,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-07 20:59:56,657 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 700 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:56,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 546 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 20:59:56,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2024-11-07 20:59:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 3908. [2024-11-07 20:59:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3206 states have (on average 1.2844666250779788) internal successors, (4118), 3267 states have internal predecessors, (4118), 384 states have call successors, (384), 258 states have call predecessors, (384), 314 states have return successors, (586), 384 states have call predecessors, (586), 384 states have call successors, (586) [2024-11-07 20:59:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5088 transitions. [2024-11-07 20:59:56,946 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5088 transitions. Word has length 77 [2024-11-07 20:59:56,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:56,948 INFO L471 AbstractCegarLoop]: Abstraction has 3908 states and 5088 transitions. [2024-11-07 20:59:56,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 20:59:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5088 transitions. [2024-11-07 20:59:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 20:59:56,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:56,951 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 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 20:59:56,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 20:59:56,951 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:56,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash 654619595, now seen corresponding path program 1 times [2024-11-07 20:59:56,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:56,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266083138] [2024-11-07 20:59:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:57,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:57,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:57,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:57,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 20:59:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:57,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 20:59:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:59:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 20:59:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266083138] [2024-11-07 20:59:57,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266083138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:57,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:57,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 20:59:57,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794158] [2024-11-07 20:59:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 20:59:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 20:59:57,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:57,142 INFO L87 Difference]: Start difference. First operand 3908 states and 5088 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 20:59:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:57,786 INFO L93 Difference]: Finished difference Result 7528 states and 9761 transitions. [2024-11-07 20:59:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 20:59:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2024-11-07 20:59:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:57,804 INFO L225 Difference]: With dead ends: 7528 [2024-11-07 20:59:57,804 INFO L226 Difference]: Without dead ends: 4409 [2024-11-07 20:59:57,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-07 20:59:57,811 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 459 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:57,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 422 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:59:57,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2024-11-07 20:59:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 3876. [2024-11-07 20:59:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3170 states have (on average 1.2750788643533124) internal successors, (4042), 3235 states have internal predecessors, (4042), 384 states have call successors, (384), 258 states have call predecessors, (384), 318 states have return successors, (531), 384 states have call predecessors, (531), 384 states have call successors, (531) [2024-11-07 20:59:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 4957 transitions. [2024-11-07 20:59:58,147 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 4957 transitions. Word has length 91 [2024-11-07 20:59:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:58,147 INFO L471 AbstractCegarLoop]: Abstraction has 3876 states and 4957 transitions. [2024-11-07 20:59:58,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 20:59:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 4957 transitions. [2024-11-07 20:59:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 20:59:58,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:58,153 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 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 20:59:58,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 20:59:58,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:58,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1979475789, now seen corresponding path program 1 times [2024-11-07 20:59:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:58,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649232246] [2024-11-07 20:59:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:58,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 20:59:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 20:59:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:59:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 20:59:58,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649232246] [2024-11-07 20:59:58,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649232246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:58,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:58,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:59:58,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348422020] [2024-11-07 20:59:58,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:58,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:59:58,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:58,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:59:58,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:58,229 INFO L87 Difference]: Start difference. First operand 3876 states and 4957 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 20:59:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:58,666 INFO L93 Difference]: Finished difference Result 4271 states and 5475 transitions. [2024-11-07 20:59:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:59:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2024-11-07 20:59:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:58,685 INFO L225 Difference]: With dead ends: 4271 [2024-11-07 20:59:58,686 INFO L226 Difference]: Without dead ends: 3518 [2024-11-07 20:59:58,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:59:58,689 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 275 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:58,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 242 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:59:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2024-11-07 20:59:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3125. [2024-11-07 20:59:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 2560 states have (on average 1.280078125) internal successors, (3277), 2615 states have internal predecessors, (3277), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (431), 306 states have call predecessors, (431), 303 states have call successors, (431) [2024-11-07 20:59:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4011 transitions. [2024-11-07 20:59:58,933 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4011 transitions. Word has length 91 [2024-11-07 20:59:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:58,934 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4011 transitions. [2024-11-07 20:59:58,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 20:59:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4011 transitions. [2024-11-07 20:59:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 20:59:58,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:58,937 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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 20:59:58,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 20:59:58,937 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:59:58,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1024919005, now seen corresponding path program 1 times [2024-11-07 20:59:58,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:58,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036627119] [2024-11-07 20:59:58,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:58,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 20:59:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 20:59:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:59,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:59:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:59,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:59:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:59,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:59:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:59,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 20:59:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:59,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 20:59:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:59,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 20:59:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 20:59:59,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036627119] [2024-11-07 20:59:59,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036627119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:59,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:59,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 20:59:59,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041152334] [2024-11-07 20:59:59,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:59,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 20:59:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:59,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 20:59:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:59,035 INFO L87 Difference]: Start difference. First operand 3125 states and 4011 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 21:00:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:00,006 INFO L93 Difference]: Finished difference Result 5468 states and 7103 transitions. [2024-11-07 21:00:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 21:00:00,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2024-11-07 21:00:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:00,018 INFO L225 Difference]: With dead ends: 5468 [2024-11-07 21:00:00,018 INFO L226 Difference]: Without dead ends: 3435 [2024-11-07 21:00:00,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-07 21:00:00,022 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1051 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:00,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 615 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 21:00:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2024-11-07 21:00:00,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3125. [2024-11-07 21:00:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 2560 states have (on average 1.271484375) internal successors, (3255), 2615 states have internal predecessors, (3255), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2024-11-07 21:00:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 3956 transitions. [2024-11-07 21:00:00,232 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 3956 transitions. Word has length 93 [2024-11-07 21:00:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:00,232 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 3956 transitions. [2024-11-07 21:00:00,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 21:00:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 3956 transitions. [2024-11-07 21:00:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 21:00:00,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:00,235 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:00,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 21:00:00,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 21:00:00,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1670091637, now seen corresponding path program 1 times [2024-11-07 21:00:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:00,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712672169] [2024-11-07 21:00:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:00,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 21:00:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:00,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 21:00:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:00,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 21:00:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 21:00:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:00,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 21:00:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:00,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 21:00:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 21:00:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 21:00:00,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:00,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712672169] [2024-11-07 21:00:00,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712672169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:00,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:00:00,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 21:00:00,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125038947] [2024-11-07 21:00:00,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:00,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 21:00:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:00,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 21:00:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 21:00:00,333 INFO L87 Difference]: Start difference. First operand 3125 states and 3956 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 21:00:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:00,877 INFO L93 Difference]: Finished difference Result 3518 states and 4474 transitions. [2024-11-07 21:00:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 21:00:00,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 100 [2024-11-07 21:00:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:00,893 INFO L225 Difference]: With dead ends: 3518 [2024-11-07 21:00:00,893 INFO L226 Difference]: Without dead ends: 3517 [2024-11-07 21:00:00,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 21:00:00,895 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 269 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:00,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 230 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 21:00:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2024-11-07 21:00:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3124. [2024-11-07 21:00:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 2560 states have (on average 1.26796875) internal successors, (3246), 2614 states have internal predecessors, (3246), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2024-11-07 21:00:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 3947 transitions. [2024-11-07 21:00:01,156 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 3947 transitions. Word has length 100 [2024-11-07 21:00:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:01,156 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 3947 transitions. [2024-11-07 21:00:01,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 21:00:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 3947 transitions. [2024-11-07 21:00:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 21:00:01,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:01,159 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:01,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 21:00:01,160 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 21:00:01,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:01,160 INFO L85 PathProgramCache]: Analyzing trace with hash 233233506, now seen corresponding path program 1 times [2024-11-07 21:00:01,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:01,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072970405] [2024-11-07 21:00:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 21:00:01,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 21:00:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 21:00:01,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 21:00:01,215 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 21:00:01,217 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 21:00:01,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 21:00:01,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 21:00:01,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 21:00:01,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 21:00:01,222 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:00:01,311 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 21:00:01,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:00:01 BoogieIcfgContainer [2024-11-07 21:00:01,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 21:00:01,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 21:00:01,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 21:00:01,317 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 21:00:01,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:44" (3/4) ... [2024-11-07 21:00:01,318 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 21:00:01,396 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 21:00:01,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 21:00:01,397 INFO L158 Benchmark]: Toolchain (without parser) took 17148.56ms. Allocated memory was 117.4MB in the beginning and 738.2MB in the end (delta: 620.8MB). Free memory was 92.2MB in the beginning and 619.3MB in the end (delta: -527.1MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2024-11-07 21:00:01,397 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:00:01,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.68ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 21:00:01,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.06ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 77.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:00:01,398 INFO L158 Benchmark]: Boogie Preprocessor took 31.96ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:00:01,398 INFO L158 Benchmark]: RCFGBuilder took 377.04ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 56.8MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 21:00:01,398 INFO L158 Benchmark]: TraceAbstraction took 16377.61ms. Allocated memory was 117.4MB in the beginning and 738.2MB in the end (delta: 620.8MB). Free memory was 56.2MB in the beginning and 627.7MB in the end (delta: -571.5MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2024-11-07 21:00:01,398 INFO L158 Benchmark]: Witness Printer took 79.70ms. Allocated memory is still 738.2MB. Free memory was 627.7MB in the beginning and 619.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 21:00:01,399 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.30ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.68ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.06ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 77.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.96ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 377.04ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 56.8MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16377.61ms. Allocated memory was 117.4MB in the beginning and 738.2MB in the end (delta: 620.8MB). Free memory was 56.2MB in the beginning and 627.7MB in the end (delta: -571.5MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. * Witness Printer took 79.70ms. Allocated memory is still 738.2MB. Free memory was 627.7MB in the beginning and 619.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 119]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L353] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L146] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L148] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L167] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L353] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L119] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 124 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6874 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6691 mSDsluCounter, 9391 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6953 mSDsCounter, 1217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7828 IncrementalHoareTripleChecker+Invalid, 9045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1217 mSolverCounterUnsat, 2438 mSDtfsCounter, 7828 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3908occurred in iteration=14, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 4250 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1279 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 121/121 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-07 21:00:01,431 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)