./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.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/mem_slave_tlm.1.cil.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', 'c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78'] 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/mem_slave_tlm.1.cil.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 c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:59:22,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:59:23,076 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:23,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:59:23,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:59:23,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:59:23,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:59:23,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:59:23,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:59:23,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:59:23,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:59:23,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:59:23,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:59:23,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:59:23,116 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:59:23,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:59:23,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:59:23,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:59:23,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:59:23,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:59:23,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:59:23,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:59:23,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:59:23,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:59:23,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:59:23,117 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:59:23,117 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:59:23,118 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:59:23,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:59:23,118 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:59:23,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:59:23,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:59:23,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:59:23,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:59:23,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:59:23,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:59:23,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:59:23,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:59:23,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:59:23,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:59:23,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:59:23,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:59:23,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:59:23,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:59:23,119 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 -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2024-11-07 20:59:23,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:59:23,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:59:23,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:59:23,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:59:23,430 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:59:23,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-11-07 20:59:24,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:59:24,904 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:59:24,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-11-07 20:59:24,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f75c1b07/9be4ee3d896b43cca245ccfcb934cf2c/FLAGf1e81fb1a [2024-11-07 20:59:24,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f75c1b07/9be4ee3d896b43cca245ccfcb934cf2c [2024-11-07 20:59:24,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:59:24,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:59:24,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:59:24,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:59:24,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:59:24,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:59:24" (1/1) ... [2024-11-07 20:59:24,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7d7ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:24, skipping insertion in model container [2024-11-07 20:59:24,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:59:24" (1/1) ... [2024-11-07 20:59:24,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:59:25,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:59:25,241 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:59:25,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:59:25,363 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:59:25,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:25 WrapperNode [2024-11-07 20:59:25,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:59:25,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:59:25,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:59:25,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:59:25,371 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:25" (1/1) ... [2024-11-07 20:59:25,387 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:25" (1/1) ... [2024-11-07 20:59:25,431 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 860 [2024-11-07 20:59:25,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:59:25,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:59:25,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:59:25,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:59:25,442 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:25" (1/1) ... [2024-11-07 20:59:25,442 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:25" (1/1) ... [2024-11-07 20:59:25,446 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:25" (1/1) ... [2024-11-07 20:59:25,460 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:25,460 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:25" (1/1) ... [2024-11-07 20:59:25,460 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:25" (1/1) ... [2024-11-07 20:59:25,476 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:25" (1/1) ... [2024-11-07 20:59:25,492 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:25" (1/1) ... [2024-11-07 20:59:25,496 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:25" (1/1) ... [2024-11-07 20:59:25,498 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:25" (1/1) ... [2024-11-07 20:59:25,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:59:25,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:59:25,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:59:25,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:59:25,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:25" (1/1) ... [2024-11-07 20:59:25,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:59:25,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:59:25,547 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:25,554 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:25,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:59:25,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:59:25,573 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 20:59:25,574 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 20:59:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:59:25,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:59:25,679 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:59:25,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:59:26,470 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-11-07 20:59:26,470 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:59:26,488 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:59:26,491 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-07 20:59:26,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:26 BoogieIcfgContainer [2024-11-07 20:59:26,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:59:26,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:59:26,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:59:26,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:59:26,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:59:24" (1/3) ... [2024-11-07 20:59:26,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b011e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:59:26, skipping insertion in model container [2024-11-07 20:59:26,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:25" (2/3) ... [2024-11-07 20:59:26,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b011e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:59:26, skipping insertion in model container [2024-11-07 20:59:26,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:26" (3/3) ... [2024-11-07 20:59:26,503 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2024-11-07 20:59:26,516 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:59:26,517 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-07 20:59:26,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:59:26,591 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;@dc5e69a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:59:26,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 20:59:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 271 states have (on average 1.8523985239852399) internal successors, (502), 284 states have internal predecessors, (502), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:59:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 20:59:26,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:26,606 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] [2024-11-07 20:59:26,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:26,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1773166344, now seen corresponding path program 1 times [2024-11-07 20:59:26,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:26,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638225830] [2024-11-07 20:59:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:26,835 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:26,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:26,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638225830] [2024-11-07 20:59:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638225830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:26,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:26,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:59:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141608936] [2024-11-07 20:59:26,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:26,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:26,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:26,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:26,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:26,860 INFO L87 Difference]: Start difference. First operand has 286 states, 271 states have (on average 1.8523985239852399) internal successors, (502), 284 states have internal predecessors, (502), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:27,247 INFO L93 Difference]: Finished difference Result 755 states and 1348 transitions. [2024-11-07 20:59:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:27,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-07 20:59:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:27,263 INFO L225 Difference]: With dead ends: 755 [2024-11-07 20:59:27,263 INFO L226 Difference]: Without dead ends: 454 [2024-11-07 20:59:27,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:27,274 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 269 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:27,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 793 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:59:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-07 20:59:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2024-11-07 20:59:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 432 states have (on average 1.5856481481481481) internal successors, (685), 439 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 685 transitions. [2024-11-07 20:59:27,351 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 685 transitions. Word has length 20 [2024-11-07 20:59:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:27,351 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 685 transitions. [2024-11-07 20:59:27,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 685 transitions. [2024-11-07 20:59:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 20:59:27,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:27,352 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] [2024-11-07 20:59:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:59:27,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:27,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:27,353 INFO L85 PathProgramCache]: Analyzing trace with hash 282207273, now seen corresponding path program 1 times [2024-11-07 20:59:27,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:27,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551477091] [2024-11-07 20:59:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:27,466 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:27,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:27,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551477091] [2024-11-07 20:59:27,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551477091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:27,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:27,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:59:27,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791290308] [2024-11-07 20:59:27,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:27,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:27,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:27,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:27,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:27,469 INFO L87 Difference]: Start difference. First operand 440 states and 685 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:27,566 INFO L93 Difference]: Finished difference Result 1116 states and 1750 transitions. [2024-11-07 20:59:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:27,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-07 20:59:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:27,570 INFO L225 Difference]: With dead ends: 1116 [2024-11-07 20:59:27,570 INFO L226 Difference]: Without dead ends: 690 [2024-11-07 20:59:27,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:27,572 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 238 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:27,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1058 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:59:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-07 20:59:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 682. [2024-11-07 20:59:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 674 states have (on average 1.5771513353115727) internal successors, (1063), 681 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1063 transitions. [2024-11-07 20:59:27,609 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1063 transitions. Word has length 24 [2024-11-07 20:59:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:27,609 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1063 transitions. [2024-11-07 20:59:27,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1063 transitions. [2024-11-07 20:59:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 20:59:27,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:27,612 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 20:59:27,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:59:27,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:27,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1461842607, now seen corresponding path program 1 times [2024-11-07 20:59:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:27,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466282698] [2024-11-07 20:59:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:27,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:27,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466282698] [2024-11-07 20:59:27,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466282698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:27,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:27,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:59:27,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428244083] [2024-11-07 20:59:27,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:27,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:59:27,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:27,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:59:27,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:59:27,736 INFO L87 Difference]: Start difference. First operand 682 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:28,137 INFO L93 Difference]: Finished difference Result 1632 states and 2556 transitions. [2024-11-07 20:59:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:59:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 20:59:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:28,145 INFO L225 Difference]: With dead ends: 1632 [2024-11-07 20:59:28,146 INFO L226 Difference]: Without dead ends: 964 [2024-11-07 20:59:28,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:28,149 INFO L432 NwaCegarLoop]: 649 mSDtfsCounter, 616 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:28,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1491 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:59:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-11-07 20:59:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 848. [2024-11-07 20:59:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 840 states have (on average 1.5833333333333333) internal successors, (1330), 847 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1330 transitions. [2024-11-07 20:59:28,193 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1330 transitions. Word has length 55 [2024-11-07 20:59:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:28,194 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1330 transitions. [2024-11-07 20:59:28,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1330 transitions. [2024-11-07 20:59:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 20:59:28,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:28,197 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 20:59:28,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:59:28,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:28,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:28,198 INFO L85 PathProgramCache]: Analyzing trace with hash 264726864, now seen corresponding path program 1 times [2024-11-07 20:59:28,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:28,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076701311] [2024-11-07 20:59:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:28,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:28,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076701311] [2024-11-07 20:59:28,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076701311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:28,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:28,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:59:28,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958143007] [2024-11-07 20:59:28,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:28,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:59:28,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:28,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:59:28,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:59:28,306 INFO L87 Difference]: Start difference. First operand 848 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:28,616 INFO L93 Difference]: Finished difference Result 2112 states and 3294 transitions. [2024-11-07 20:59:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:59:28,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-07 20:59:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:28,622 INFO L225 Difference]: With dead ends: 2112 [2024-11-07 20:59:28,622 INFO L226 Difference]: Without dead ends: 1278 [2024-11-07 20:59:28,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:59:28,624 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 427 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:28,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1535 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:59:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2024-11-07 20:59:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1191. [2024-11-07 20:59:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1183 states have (on average 1.5672020287404902) internal successors, (1854), 1190 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1854 transitions. [2024-11-07 20:59:28,659 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1854 transitions. Word has length 58 [2024-11-07 20:59:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:28,659 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1854 transitions. [2024-11-07 20:59:28,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1854 transitions. [2024-11-07 20:59:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 20:59:28,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:28,662 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:59:28,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:59:28,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash 93056873, now seen corresponding path program 1 times [2024-11-07 20:59:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123856521] [2024-11-07 20:59:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123856521] [2024-11-07 20:59:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123856521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:59:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917591716] [2024-11-07 20:59:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:28,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:59:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:28,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:59:28,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:59:28,758 INFO L87 Difference]: Start difference. First operand 1191 states and 1854 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:29,166 INFO L93 Difference]: Finished difference Result 3750 states and 5723 transitions. [2024-11-07 20:59:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:59:29,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 20:59:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:29,178 INFO L225 Difference]: With dead ends: 3750 [2024-11-07 20:59:29,178 INFO L226 Difference]: Without dead ends: 2570 [2024-11-07 20:59:29,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:29,184 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 685 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:29,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1079 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:59:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2024-11-07 20:59:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2224. [2024-11-07 20:59:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2224 states, 2216 states have (on average 1.5374548736462095) internal successors, (3407), 2223 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3407 transitions. [2024-11-07 20:59:29,281 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3407 transitions. Word has length 69 [2024-11-07 20:59:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:29,282 INFO L471 AbstractCegarLoop]: Abstraction has 2224 states and 3407 transitions. [2024-11-07 20:59:29,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3407 transitions. [2024-11-07 20:59:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 20:59:29,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:29,284 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:59:29,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:59:29,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:29,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:29,285 INFO L85 PathProgramCache]: Analyzing trace with hash 848997769, now seen corresponding path program 1 times [2024-11-07 20:59:29,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:29,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222513403] [2024-11-07 20:59:29,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:29,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:29,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:29,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222513403] [2024-11-07 20:59:29,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222513403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:29,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:29,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:59:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324139228] [2024-11-07 20:59:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:29,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:29,368 INFO L87 Difference]: Start difference. First operand 2224 states and 3407 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:29,450 INFO L93 Difference]: Finished difference Result 4678 states and 7256 transitions. [2024-11-07 20:59:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:29,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 20:59:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:29,461 INFO L225 Difference]: With dead ends: 4678 [2024-11-07 20:59:29,461 INFO L226 Difference]: Without dead ends: 2467 [2024-11-07 20:59:29,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:29,465 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 362 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:29,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 694 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:59:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2024-11-07 20:59:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2260. [2024-11-07 20:59:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2252 states have (on average 1.5697158081705151) internal successors, (3535), 2259 states have internal predecessors, (3535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3535 transitions. [2024-11-07 20:59:29,567 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3535 transitions. Word has length 69 [2024-11-07 20:59:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:29,567 INFO L471 AbstractCegarLoop]: Abstraction has 2260 states and 3535 transitions. [2024-11-07 20:59:29,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3535 transitions. [2024-11-07 20:59:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 20:59:29,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:29,570 INFO L215 NwaCegarLoop]: trace histogram [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, 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:29,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 20:59:29,570 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:29,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1060133084, now seen corresponding path program 1 times [2024-11-07 20:59:29,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:29,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690188128] [2024-11-07 20:59:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690188128] [2024-11-07 20:59:29,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690188128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:29,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:29,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:59:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176769164] [2024-11-07 20:59:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:29,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:29,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:29,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:29,627 INFO L87 Difference]: Start difference. First operand 2260 states and 3535 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:29,760 INFO L93 Difference]: Finished difference Result 4815 states and 7522 transitions. [2024-11-07 20:59:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:29,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-07 20:59:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:29,771 INFO L225 Difference]: With dead ends: 4815 [2024-11-07 20:59:29,771 INFO L226 Difference]: Without dead ends: 2567 [2024-11-07 20:59:29,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:29,775 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 193 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:29,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 823 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:59:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2024-11-07 20:59:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2553. [2024-11-07 20:59:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2545 states have (on average 1.5618860510805501) internal successors, (3975), 2552 states have internal predecessors, (3975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3975 transitions. [2024-11-07 20:59:29,893 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3975 transitions. Word has length 87 [2024-11-07 20:59:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:29,893 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 3975 transitions. [2024-11-07 20:59:29,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3975 transitions. [2024-11-07 20:59:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 20:59:29,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:29,897 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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:29,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 20:59:29,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:29,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash 809233504, now seen corresponding path program 1 times [2024-11-07 20:59:29,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786540231] [2024-11-07 20:59:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:29,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786540231] [2024-11-07 20:59:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786540231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:29,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:29,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:59:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334399436] [2024-11-07 20:59:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:29,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:29,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:29,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:29,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:29,995 INFO L87 Difference]: Start difference. First operand 2553 states and 3975 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:30,313 INFO L93 Difference]: Finished difference Result 5993 states and 9430 transitions. [2024-11-07 20:59:30,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:30,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-07 20:59:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:30,329 INFO L225 Difference]: With dead ends: 5993 [2024-11-07 20:59:30,329 INFO L226 Difference]: Without dead ends: 3616 [2024-11-07 20:59:30,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:30,336 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 248 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:30,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 868 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:59:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2024-11-07 20:59:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 2983. [2024-11-07 20:59:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2975 states have (on average 1.4857142857142858) internal successors, (4420), 2982 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4420 transitions. [2024-11-07 20:59:30,461 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4420 transitions. Word has length 96 [2024-11-07 20:59:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:30,462 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 4420 transitions. [2024-11-07 20:59:30,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4420 transitions. [2024-11-07 20:59:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 20:59:30,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:30,467 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 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:30,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 20:59:30,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:30,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1044800824, now seen corresponding path program 1 times [2024-11-07 20:59:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839286952] [2024-11-07 20:59:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 20:59:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839286952] [2024-11-07 20:59:30,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839286952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:30,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:30,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:59:30,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137066225] [2024-11-07 20:59:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:30,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:59:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:30,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:59:30,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:59:30,590 INFO L87 Difference]: Start difference. First operand 2983 states and 4420 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:30,930 INFO L93 Difference]: Finished difference Result 5993 states and 8876 transitions. [2024-11-07 20:59:30,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:59:30,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-07 20:59:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:30,943 INFO L225 Difference]: With dead ends: 5993 [2024-11-07 20:59:30,943 INFO L226 Difference]: Without dead ends: 3227 [2024-11-07 20:59:30,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:30,949 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 615 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:30,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1279 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:59:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2024-11-07 20:59:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3152. [2024-11-07 20:59:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3144 states have (on average 1.4802798982188294) internal successors, (4654), 3151 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 4654 transitions. [2024-11-07 20:59:31,084 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 4654 transitions. Word has length 104 [2024-11-07 20:59:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:31,084 INFO L471 AbstractCegarLoop]: Abstraction has 3152 states and 4654 transitions. [2024-11-07 20:59:31,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 4654 transitions. [2024-11-07 20:59:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 20:59:31,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:31,087 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 20:59:31,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:31,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2134366008, now seen corresponding path program 1 times [2024-11-07 20:59:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:31,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050747695] [2024-11-07 20:59:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:31,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:31,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050747695] [2024-11-07 20:59:31,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050747695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:31,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:31,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:59:31,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449661499] [2024-11-07 20:59:31,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:31,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:31,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:31,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:31,166 INFO L87 Difference]: Start difference. First operand 3152 states and 4654 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:31,275 INFO L93 Difference]: Finished difference Result 6118 states and 9062 transitions. [2024-11-07 20:59:31,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:31,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-07 20:59:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:31,288 INFO L225 Difference]: With dead ends: 6118 [2024-11-07 20:59:31,289 INFO L226 Difference]: Without dead ends: 3152 [2024-11-07 20:59:31,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:31,296 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 336 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:31,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 436 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:59:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2024-11-07 20:59:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 3152. [2024-11-07 20:59:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3144 states have (on average 1.4481552162849873) internal successors, (4553), 3151 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 4553 transitions. [2024-11-07 20:59:31,426 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 4553 transitions. Word has length 104 [2024-11-07 20:59:31,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:31,427 INFO L471 AbstractCegarLoop]: Abstraction has 3152 states and 4553 transitions. [2024-11-07 20:59:31,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 4553 transitions. [2024-11-07 20:59:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 20:59:31,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:31,429 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 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:31,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 20:59:31,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:31,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:31,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1174128625, now seen corresponding path program 1 times [2024-11-07 20:59:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:31,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734977580] [2024-11-07 20:59:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:59:31,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:31,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734977580] [2024-11-07 20:59:31,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734977580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:31,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:31,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:59:31,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568332258] [2024-11-07 20:59:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:31,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:31,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:31,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:31,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:31,473 INFO L87 Difference]: Start difference. First operand 3152 states and 4553 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:31,638 INFO L93 Difference]: Finished difference Result 8079 states and 11760 transitions. [2024-11-07 20:59:31,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:31,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-07 20:59:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:31,661 INFO L225 Difference]: With dead ends: 8079 [2024-11-07 20:59:31,664 INFO L226 Difference]: Without dead ends: 4939 [2024-11-07 20:59:31,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:31,671 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 314 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:31,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1021 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:59:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2024-11-07 20:59:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4449. [2024-11-07 20:59:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4449 states, 4441 states have (on average 1.4550776852060348) internal successors, (6462), 4448 states have internal predecessors, (6462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 6462 transitions. [2024-11-07 20:59:31,860 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 6462 transitions. Word has length 105 [2024-11-07 20:59:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:31,861 INFO L471 AbstractCegarLoop]: Abstraction has 4449 states and 6462 transitions. [2024-11-07 20:59:31,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 6462 transitions. [2024-11-07 20:59:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 20:59:31,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:31,863 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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:31,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 20:59:31,864 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:31,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash -352874665, now seen corresponding path program 1 times [2024-11-07 20:59:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:31,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144020370] [2024-11-07 20:59:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:59:31,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:31,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144020370] [2024-11-07 20:59:31,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144020370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:31,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:31,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:59:31,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176653215] [2024-11-07 20:59:31,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:31,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:59:31,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:31,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:59:31,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:59:31,931 INFO L87 Difference]: Start difference. First operand 4449 states and 6462 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:32,420 INFO L93 Difference]: Finished difference Result 11981 states and 17278 transitions. [2024-11-07 20:59:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:59:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-11-07 20:59:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:32,448 INFO L225 Difference]: With dead ends: 11981 [2024-11-07 20:59:32,449 INFO L226 Difference]: Without dead ends: 7435 [2024-11-07 20:59:32,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:32,457 INFO L432 NwaCegarLoop]: 612 mSDtfsCounter, 651 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:32,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1329 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:59:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2024-11-07 20:59:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6646. [2024-11-07 20:59:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6646 states, 6638 states have (on average 1.4344682133172642) internal successors, (9522), 6645 states have internal predecessors, (9522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 9522 transitions. [2024-11-07 20:59:32,725 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 9522 transitions. Word has length 107 [2024-11-07 20:59:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:32,726 INFO L471 AbstractCegarLoop]: Abstraction has 6646 states and 9522 transitions. [2024-11-07 20:59:32,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 9522 transitions. [2024-11-07 20:59:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 20:59:32,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:32,730 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 20:59:32,731 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:32,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:32,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1728043503, now seen corresponding path program 1 times [2024-11-07 20:59:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455712139] [2024-11-07 20:59:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:32,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455712139] [2024-11-07 20:59:32,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455712139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:32,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:32,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:59:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105239204] [2024-11-07 20:59:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:59:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:59:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:32,814 INFO L87 Difference]: Start difference. First operand 6646 states and 9522 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:33,102 INFO L93 Difference]: Finished difference Result 17797 states and 25457 transitions. [2024-11-07 20:59:33,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 20:59:33,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-07 20:59:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:33,131 INFO L225 Difference]: With dead ends: 17797 [2024-11-07 20:59:33,131 INFO L226 Difference]: Without dead ends: 11485 [2024-11-07 20:59:33,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:33,144 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 633 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:33,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 2264 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:59:33,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11485 states. [2024-11-07 20:59:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11485 to 10146. [2024-11-07 20:59:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10146 states, 10138 states have (on average 1.4378575655947918) internal successors, (14577), 10145 states have internal predecessors, (14577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 14577 transitions. [2024-11-07 20:59:33,465 INFO L78 Accepts]: Start accepts. Automaton has 10146 states and 14577 transitions. Word has length 113 [2024-11-07 20:59:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:33,466 INFO L471 AbstractCegarLoop]: Abstraction has 10146 states and 14577 transitions. [2024-11-07 20:59:33,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 10146 states and 14577 transitions. [2024-11-07 20:59:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 20:59:33,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:33,470 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 20:59:33,470 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:33,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:33,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1864219126, now seen corresponding path program 1 times [2024-11-07 20:59:33,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:33,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501317517] [2024-11-07 20:59:33,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:33,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 20:59:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:33,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501317517] [2024-11-07 20:59:33,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501317517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:33,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:59:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490492460] [2024-11-07 20:59:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:33,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:33,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:33,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:33,522 INFO L87 Difference]: Start difference. First operand 10146 states and 14577 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:33,784 INFO L93 Difference]: Finished difference Result 20067 states and 28850 transitions. [2024-11-07 20:59:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:33,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-07 20:59:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:33,810 INFO L225 Difference]: With dead ends: 20067 [2024-11-07 20:59:33,810 INFO L226 Difference]: Without dead ends: 10005 [2024-11-07 20:59:33,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:33,826 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 348 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:33,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 835 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:59:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10005 states. [2024-11-07 20:59:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10005 to 9944. [2024-11-07 20:59:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9944 states, 9936 states have (on average 1.3970410628019323) internal successors, (13881), 9943 states have internal predecessors, (13881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 13881 transitions. [2024-11-07 20:59:34,208 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 13881 transitions. Word has length 115 [2024-11-07 20:59:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:34,208 INFO L471 AbstractCegarLoop]: Abstraction has 9944 states and 13881 transitions. [2024-11-07 20:59:34,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 13881 transitions. [2024-11-07 20:59:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 20:59:34,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:34,210 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 20:59:34,211 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:34,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:34,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1933744648, now seen corresponding path program 1 times [2024-11-07 20:59:34,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:34,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077771261] [2024-11-07 20:59:34,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:34,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:59:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:34,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077771261] [2024-11-07 20:59:34,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077771261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:59:34,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117385298] [2024-11-07 20:59:34,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:34,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:59:34,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:59:34,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:59:34,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 20:59:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:34,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 20:59:34,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:59:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 20:59:34,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:59:34,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117385298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:34,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:59:34,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-07 20:59:34,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603796261] [2024-11-07 20:59:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:34,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:34,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:34,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:59:34,560 INFO L87 Difference]: Start difference. First operand 9944 states and 13881 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:34,810 INFO L93 Difference]: Finished difference Result 18599 states and 26006 transitions. [2024-11-07 20:59:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:34,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-07 20:59:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:34,831 INFO L225 Difference]: With dead ends: 18599 [2024-11-07 20:59:34,831 INFO L226 Difference]: Without dead ends: 8598 [2024-11-07 20:59:34,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:59:34,839 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 293 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:34,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 465 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:59:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8598 states. [2024-11-07 20:59:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8598 to 8027. [2024-11-07 20:59:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8027 states, 8019 states have (on average 1.3933158747973562) internal successors, (11173), 8026 states have internal predecessors, (11173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8027 states to 8027 states and 11173 transitions. [2024-11-07 20:59:35,021 INFO L78 Accepts]: Start accepts. Automaton has 8027 states and 11173 transitions. Word has length 115 [2024-11-07 20:59:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:35,022 INFO L471 AbstractCegarLoop]: Abstraction has 8027 states and 11173 transitions. [2024-11-07 20:59:35,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 8027 states and 11173 transitions. [2024-11-07 20:59:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 20:59:35,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:35,024 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 20:59:35,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 20:59:35,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:35,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1930156709, now seen corresponding path program 1 times [2024-11-07 20:59:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429934493] [2024-11-07 20:59:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 20:59:35,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429934493] [2024-11-07 20:59:35,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429934493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:35,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:35,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:59:35,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268046487] [2024-11-07 20:59:35,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:35,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:59:35,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:35,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:59:35,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:59:35,336 INFO L87 Difference]: Start difference. First operand 8027 states and 11173 transitions. Second operand has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:35,705 INFO L93 Difference]: Finished difference Result 16652 states and 23154 transitions. [2024-11-07 20:59:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:59:35,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-11-07 20:59:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:35,745 INFO L225 Difference]: With dead ends: 16652 [2024-11-07 20:59:35,745 INFO L226 Difference]: Without dead ends: 16648 [2024-11-07 20:59:35,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:35,752 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 728 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:35,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1303 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:59:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16648 states. [2024-11-07 20:59:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16648 to 14601. [2024-11-07 20:59:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14593 states have (on average 1.4051942712259302) internal successors, (20506), 14600 states have internal predecessors, (20506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 20506 transitions. [2024-11-07 20:59:36,170 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 20506 transitions. Word has length 117 [2024-11-07 20:59:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:36,172 INFO L471 AbstractCegarLoop]: Abstraction has 14601 states and 20506 transitions. [2024-11-07 20:59:36,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 20506 transitions. [2024-11-07 20:59:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 20:59:36,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:36,174 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 20:59:36,174 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:36,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1274447402, now seen corresponding path program 1 times [2024-11-07 20:59:36,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:36,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953250118] [2024-11-07 20:59:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 20:59:36,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:36,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953250118] [2024-11-07 20:59:36,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953250118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:59:36,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048910488] [2024-11-07 20:59:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:36,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:59:36,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:59:36,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:59:36,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 20:59:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:36,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 20:59:36,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:59:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 20:59:36,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:59:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048910488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:36,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:59:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-07 20:59:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452753019] [2024-11-07 20:59:36,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:36,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:59:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:59:36,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:36,475 INFO L87 Difference]: Start difference. First operand 14601 states and 20506 transitions. Second operand has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:36,876 INFO L93 Difference]: Finished difference Result 14982 states and 21010 transitions. [2024-11-07 20:59:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:59:36,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-07 20:59:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:36,916 INFO L225 Difference]: With dead ends: 14982 [2024-11-07 20:59:36,916 INFO L226 Difference]: Without dead ends: 14981 [2024-11-07 20:59:36,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:36,922 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 151 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:36,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1257 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:59:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14981 states. [2024-11-07 20:59:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14981 to 14600. [2024-11-07 20:59:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14600 states, 14593 states have (on average 1.4037552251079284) internal successors, (20485), 14599 states have internal predecessors, (20485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 20485 transitions. [2024-11-07 20:59:37,442 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 20485 transitions. Word has length 122 [2024-11-07 20:59:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:37,443 INFO L471 AbstractCegarLoop]: Abstraction has 14600 states and 20485 transitions. [2024-11-07 20:59:37,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 20485 transitions. [2024-11-07 20:59:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 20:59:37,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:37,445 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 20:59:37,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 20:59:37,650 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:37,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash 853164033, now seen corresponding path program 1 times [2024-11-07 20:59:37,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:37,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163417682] [2024-11-07 20:59:37,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 20:59:37,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163417682] [2024-11-07 20:59:37,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163417682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:59:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760538192] [2024-11-07 20:59:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:37,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:59:37,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:59:37,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:59:37,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 20:59:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:37,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 20:59:37,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:59:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:59:37,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:59:37,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760538192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:37,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:59:37,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 20:59:37,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565125433] [2024-11-07 20:59:37,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:37,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:37,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:37,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:37,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:59:37,951 INFO L87 Difference]: Start difference. First operand 14600 states and 20485 transitions. Second operand has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:38,331 INFO L93 Difference]: Finished difference Result 14981 states and 20989 transitions. [2024-11-07 20:59:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:38,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-11-07 20:59:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:38,364 INFO L225 Difference]: With dead ends: 14981 [2024-11-07 20:59:38,364 INFO L226 Difference]: Without dead ends: 14980 [2024-11-07 20:59:38,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:59:38,372 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 151 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:38,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 885 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:59:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14980 states. [2024-11-07 20:59:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14980 to 14599. [2024-11-07 20:59:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14599 states, 14593 states have (on average 1.4023161789899268) internal successors, (20464), 14598 states have internal predecessors, (20464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14599 states to 14599 states and 20464 transitions. [2024-11-07 20:59:38,779 INFO L78 Accepts]: Start accepts. Automaton has 14599 states and 20464 transitions. Word has length 123 [2024-11-07 20:59:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:38,779 INFO L471 AbstractCegarLoop]: Abstraction has 14599 states and 20464 transitions. [2024-11-07 20:59:38,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 14599 states and 20464 transitions. [2024-11-07 20:59:38,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 20:59:38,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:38,786 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 20:59:38,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:59:38,991 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:38,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1222314496, now seen corresponding path program 1 times [2024-11-07 20:59:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:38,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441544186] [2024-11-07 20:59:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:59:39,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:39,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441544186] [2024-11-07 20:59:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441544186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:39,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:39,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:59:39,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253160693] [2024-11-07 20:59:39,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:39,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:59:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:39,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:59:39,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:39,096 INFO L87 Difference]: Start difference. First operand 14599 states and 20464 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:39,345 INFO L93 Difference]: Finished difference Result 18721 states and 26068 transitions. [2024-11-07 20:59:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:59:39,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2024-11-07 20:59:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:39,360 INFO L225 Difference]: With dead ends: 18721 [2024-11-07 20:59:39,360 INFO L226 Difference]: Without dead ends: 4005 [2024-11-07 20:59:39,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:59:39,375 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 163 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:39,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 488 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:59:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2024-11-07 20:59:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3136. [2024-11-07 20:59:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3130 states have (on average 1.1587859424920128) internal successors, (3627), 3135 states have internal predecessors, (3627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 3627 transitions. [2024-11-07 20:59:39,450 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 3627 transitions. Word has length 205 [2024-11-07 20:59:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:39,450 INFO L471 AbstractCegarLoop]: Abstraction has 3136 states and 3627 transitions. [2024-11-07 20:59:39,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 3627 transitions. [2024-11-07 20:59:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-07 20:59:39,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:39,454 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 20:59:39,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 20:59:39,455 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -692101379, now seen corresponding path program 1 times [2024-11-07 20:59:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:39,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100315596] [2024-11-07 20:59:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 20:59:39,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:39,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100315596] [2024-11-07 20:59:39,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100315596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:59:39,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674772168] [2024-11-07 20:59:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:39,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:59:39,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:59:39,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:59:39,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 20:59:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:39,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:59:39,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:59:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 20:59:39,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:59:39,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674772168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:39,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:59:39,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-07 20:59:39,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24614856] [2024-11-07 20:59:39,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:39,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:59:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:39,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:59:39,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:39,896 INFO L87 Difference]: Start difference. First operand 3136 states and 3627 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:39,984 INFO L93 Difference]: Finished difference Result 3972 states and 4604 transitions. [2024-11-07 20:59:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:59:39,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-11-07 20:59:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:39,991 INFO L225 Difference]: With dead ends: 3972 [2024-11-07 20:59:39,991 INFO L226 Difference]: Without dead ends: 1560 [2024-11-07 20:59:39,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:59:39,993 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 292 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:39,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 612 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:59:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2024-11-07 20:59:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2024-11-07 20:59:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1558 states have (on average 1.1482670089858793) internal successors, (1789), 1559 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1789 transitions. [2024-11-07 20:59:40,046 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1789 transitions. Word has length 220 [2024-11-07 20:59:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:40,047 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 1789 transitions. [2024-11-07 20:59:40,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1789 transitions. [2024-11-07 20:59:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-07 20:59:40,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:40,051 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 20:59:40,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:59:40,255 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:40,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash 980623008, now seen corresponding path program 1 times [2024-11-07 20:59:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:40,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250589700] [2024-11-07 20:59:40,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:40,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:59:40,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250589700] [2024-11-07 20:59:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250589700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:40,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:40,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:59:40,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792220729] [2024-11-07 20:59:40,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:40,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:59:40,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:40,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:59:40,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:40,358 INFO L87 Difference]: Start difference. First operand 1560 states and 1789 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:40,436 INFO L93 Difference]: Finished difference Result 2175 states and 2505 transitions. [2024-11-07 20:59:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:59:40,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-07 20:59:40,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:40,442 INFO L225 Difference]: With dead ends: 2175 [2024-11-07 20:59:40,442 INFO L226 Difference]: Without dead ends: 1585 [2024-11-07 20:59:40,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:59:40,443 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 213 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:40,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1049 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:59:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-11-07 20:59:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1524. [2024-11-07 20:59:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1522 states have (on average 1.136005256241787) internal successors, (1729), 1523 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1729 transitions. [2024-11-07 20:59:40,482 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1729 transitions. Word has length 225 [2024-11-07 20:59:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:40,482 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 1729 transitions. [2024-11-07 20:59:40,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1729 transitions. [2024-11-07 20:59:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-07 20:59:40,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:59:40,486 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 20:59:40,486 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 20:59:40,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:59:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1076956137, now seen corresponding path program 1 times [2024-11-07 20:59:40,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:59:40,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466718098] [2024-11-07 20:59:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:59:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:59:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:59:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 20:59:40,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:59:40,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466718098] [2024-11-07 20:59:40,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466718098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:59:40,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:59:40,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:59:40,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207128522] [2024-11-07 20:59:40,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:59:40,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:59:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:59:40,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:59:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:59:40,620 INFO L87 Difference]: Start difference. First operand 1524 states and 1729 transitions. Second operand has 5 states, 4 states have (on average 54.25) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:59:40,708 INFO L93 Difference]: Finished difference Result 1539 states and 1744 transitions. [2024-11-07 20:59:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:59:40,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 54.25) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2024-11-07 20:59:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:59:40,712 INFO L225 Difference]: With dead ends: 1539 [2024-11-07 20:59:40,713 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 20:59:40,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:59:40,715 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 272 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:59:40,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 629 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:59:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 20:59:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 20:59:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 20:59:40,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2024-11-07 20:59:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:59:40,719 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 20:59:40,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 54.25) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:59:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 20:59:40,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 20:59:40,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-07 20:59:40,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-07 20:59:40,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-07 20:59:40,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-07 20:59:40,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-07 20:59:40,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-07 20:59:40,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-07 20:59:40,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-07 20:59:40,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 20:59:40,726 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, 1, 1, 1] [2024-11-07 20:59:40,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 20:59:50,801 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:59:50,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:59:50 BoogieIcfgContainer [2024-11-07 20:59:50,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:59:50,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:59:50,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:59:50,856 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:59:50,857 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:26" (3/4) ... [2024-11-07 20:59:50,859 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 20:59:50,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-07 20:59:50,884 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-07 20:59:50,885 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 20:59:50,886 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 20:59:50,887 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 20:59:51,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:59:51,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 20:59:51,049 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:59:51,050 INFO L158 Benchmark]: Toolchain (without parser) took 26112.64ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 90.6MB in the beginning and 934.6MB in the end (delta: -843.9MB). Peak memory consumption was 511.1MB. Max. memory is 16.1GB. [2024-11-07 20:59:51,050 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:59:51,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.42ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 70.9MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 20:59:51,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.36ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 67.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:59:51,057 INFO L158 Benchmark]: Boogie Preprocessor took 73.01ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 63.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:59:51,057 INFO L158 Benchmark]: RCFGBuilder took 986.55ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.0MB in the end (delta: 5.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-11-07 20:59:51,057 INFO L158 Benchmark]: TraceAbstraction took 24360.75ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 57.5MB in the beginning and 947.1MB in the end (delta: -889.6MB). Peak memory consumption was 921.4MB. Max. memory is 16.1GB. [2024-11-07 20:59:51,057 INFO L158 Benchmark]: Witness Printer took 193.21ms. Allocated memory is still 1.5GB. Free memory was 947.1MB in the beginning and 934.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:59:51,059 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.18ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.42ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 70.9MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.36ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 67.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.01ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 63.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 986.55ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.0MB in the end (delta: 5.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24360.75ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 57.5MB in the beginning and 947.1MB in the end (delta: -889.6MB). Peak memory consumption was 921.4MB. Max. memory is 16.1GB. * Witness Printer took 193.21ms. Allocated memory is still 1.5GB. Free memory was 947.1MB in the beginning and 934.6MB in the end (delta: 12.5MB). 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 - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 286 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8198 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8198 mSDsluCounter, 22193 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11545 mSDsCounter, 411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2499 IncrementalHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 411 mSolverCounterUnsat, 10648 mSDtfsCounter, 2499 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 687 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14601occurred in iteration=16, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 8489 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3060 NumberOfCodeBlocks, 3060 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3034 ConstructedInterpolants, 0 QuantifiedInterpolants, 5552 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1874 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 639/655 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (a_t == 0)) || ((((((((((2 != s_run_pc) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0))) || ((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0))) || ((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: (((((((((((((req_type___0 == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) || ((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0))) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_empty_req != 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) || ((((((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (c_empty_req != 1)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((s_run_st != 0) && (s_run_pc == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_empty_req != 1)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || ((((((((2 != s_run_pc) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || ((((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((2 != s_run_pc) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) || (((((((((2 != s_run_pc) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0))) || ((((((((2 != s_run_pc) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0))) || (((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((s_run_st != 0) && (s_run_pc == 0)) && (c_empty_req != 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (c_empty_req != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) || ((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_empty_req != 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || (((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a))) || ((((((((((2 != s_run_pc) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 876]: Location Invariant Derived location invariant: (((((((((((2 != s_run_pc) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || (((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || (((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: (((((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_type == 1)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || ((((((((2 != s_run_pc) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || ((((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((2 != s_run_pc) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) || (((((((((((req_type___0 == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0))) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0)) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) || (((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || ((((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((s_run_st != 0) && (s_run_pc == 0)) && (c_empty_req != 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (c_empty_req != 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_empty_req != 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((2 != s_run_pc) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) - ProcedureContractResult [Line: 16]: Procedure Contract for error Derived contract for procedure error. Ensures: (0 && (((((((((((((((((((((((((((((((((((((((((m_run_st == \old(m_run_st)) && (m_run_i == \old(m_run_i))) && (m_run_pc == \old(m_run_pc))) && (s_memory0 == \old(s_memory0))) && (s_run_st == \old(s_run_st))) && (s_run_i == \old(s_run_i))) && (s_run_pc == \old(s_run_pc))) && (c_m_lock == \old(c_m_lock))) && (c_m_ev == \old(c_m_ev))) && (c_req_type == \old(c_req_type))) && (c_req_a == \old(c_req_a))) && (c_req_d == \old(c_req_d))) && (c_rsp_type == \old(c_rsp_type))) && (c_rsp_status == \old(c_rsp_status))) && (c_rsp_d == \old(c_rsp_d))) && (c_empty_req == \old(c_empty_req))) && (c_empty_rsp == \old(c_empty_rsp))) && (c_read_req_ev == \old(c_read_req_ev))) && (c_write_req_ev == \old(c_write_req_ev))) && (c_read_rsp_ev == \old(c_read_rsp_ev))) && (c_write_rsp_ev == \old(c_write_rsp_ev))) && (d_t == \old(d_t))) && (a_t == \old(a_t))) && (req_t_type == \old(req_t_type))) && (req_t_a == \old(req_t_a))) && (req_t_d == \old(req_t_d))) && (rsp_t_type == \old(rsp_t_type))) && (rsp_t_status == \old(rsp_t_status))) && (rsp_t_d == \old(rsp_t_d))) && (req_tt_type == \old(req_tt_type))) && (req_tt_a == \old(req_tt_a))) && (req_tt_d == \old(req_tt_d))) && (rsp_tt_type == \old(rsp_tt_type))) && (rsp_tt_status == \old(rsp_tt_status))) && (rsp_tt_d == \old(rsp_tt_d))) && (req_t_type___0 == \old(req_t_type___0))) && (req_t_a___0 == \old(req_t_a___0))) && (req_t_d___0 == \old(req_t_d___0))) && (rsp_t_type___0 == \old(rsp_t_type___0))) && (rsp_t_status___0 == \old(rsp_t_status___0))) && (rsp_t_d___0 == \old(rsp_t_d___0)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 20:59:51,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE