./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.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', 'a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d']
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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.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 a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 20:59:54,272 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 20:59:54,350 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:54,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 20:59:54,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 20:59:54,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 20:59:54,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 20:59:54,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 20:59:54,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 20:59:54,382 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 20:59:54,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 20:59:54,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 20:59:54,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 20:59:54,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 20:59:54,384 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 20:59:54,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 20:59:54,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 20:59:54,385 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 20:59:54,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 20:59:54,385 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 20:59:54,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 20:59:54,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 20:59:54,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 20:59:54,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 20:59:54,386 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 20:59:54,386 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME
[2024-11-07 20:59:54,386 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 20:59:54,387 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 20:59:54,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 20:59:54,387 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 20:59:54,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 20:59:54,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 20:59:54,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 20:59:54,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 20:59:54,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 20:59:54,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 20:59:54,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 20:59:54,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 20:59:54,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 20:59:54,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 20:59:54,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 20:59:54,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 20:59:54,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 20:59:54,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 20:59:54,389 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 -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d
[2024-11-07 20:59:54,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 20:59:54,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 20:59:54,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 20:59:54,693 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 20:59:54,694 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 20:59:54,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c
[2024-11-07 20:59:55,963 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 20:59:56,208 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 20:59:56,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c
[2024-11-07 20:59:56,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c55cc2007/488c38104fba44e784e269e82e4f8d12/FLAG4f5cf941c
[2024-11-07 20:59:56,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c55cc2007/488c38104fba44e784e269e82e4f8d12
[2024-11-07 20:59:56,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 20:59:56,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 20:59:56,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 20:59:56,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 20:59:56,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 20:59:56,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:59:56" (1/1) ...
[2024-11-07 20:59:56,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc9df5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:56, skipping insertion in model container
[2024-11-07 20:59:56,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:59:56" (1/1) ...
[2024-11-07 20:59:56,262 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 20:59:56,465 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 20:59:56,475 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 20:59:56,544 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 20:59:56,563 INFO L204 MainTranslator]: Completed translation
[2024-11-07 20:59:56,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:56 WrapperNode
[2024-11-07 20:59:56,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 20:59:56,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 20:59:56,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 20:59:56,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 20:59:56,569 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:56" (1/1) ...
[2024-11-07 20:59:56,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:56" (1/1) ...
[2024-11-07 20:59:56,640 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 513
[2024-11-07 20:59:56,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 20:59:56,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 20:59:56,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 20:59:56,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 20:59:56,652 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:56" (1/1) ...
[2024-11-07 20:59:56,652 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:56" (1/1) ...
[2024-11-07 20:59:56,659 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:56" (1/1) ...
[2024-11-07 20:59:56,690 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:56,691 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:56" (1/1) ...
[2024-11-07 20:59:56,691 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:56" (1/1) ...
[2024-11-07 20:59:56,704 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:56" (1/1) ...
[2024-11-07 20:59:56,709 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:56" (1/1) ...
[2024-11-07 20:59:56,711 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:56" (1/1) ...
[2024-11-07 20:59:56,712 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:56" (1/1) ...
[2024-11-07 20:59:56,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 20:59:56,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 20:59:56,717 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 20:59:56,717 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 20:59:56,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:56" (1/1) ...
[2024-11-07 20:59:56,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 20:59:56,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:59:56,752 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:56,758 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:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history
[2024-11-07 20:59:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history
[2024-11-07 20:59:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 20:59:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history
[2024-11-07 20:59:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history
[2024-11-07 20:59:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure assert
[2024-11-07 20:59:56,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assert
[2024-11-07 20:59:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side
[2024-11-07 20:59:56,779 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side
[2024-11-07 20:59:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 20:59:56,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 20:59:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 20:59:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history
[2024-11-07 20:59:56,779 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history
[2024-11-07 20:59:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 20:59:56,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 20:59:56,780 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history
[2024-11-07 20:59:56,780 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history
[2024-11-07 20:59:56,901 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 20:59:56,903 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 20:59:57,473 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live.
[2024-11-07 20:59:57,473 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 20:59:57,492 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 20:59:57,494 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 20:59:57,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:57 BoogieIcfgContainer
[2024-11-07 20:59:57,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 20:59:57,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 20:59:57,496 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 20:59:57,503 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 20:59:57,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:59:56" (1/3) ...
[2024-11-07 20:59:57,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e5eee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:59:57, skipping insertion in model container
[2024-11-07 20:59:57,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:56" (2/3) ...
[2024-11-07 20:59:57,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e5eee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:59:57, skipping insertion in model container
[2024-11-07 20:59:57,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:57" (3/3) ...
[2024-11-07 20:59:57,505 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c
[2024-11-07 20:59:57,516 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 20:59:57,517 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-07 20:59:57,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 20:59:57,578 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;@3de819e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 20:59:57,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2024-11-07 20:59:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 144 states have internal predecessors, (219), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2024-11-07 20:59:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2024-11-07 20:59:57,595 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:57,596 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-11-07 20:59:57,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-11-07 20:59:57,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1144120475, now seen corresponding path program 1 times
[2024-11-07 20:59:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:57,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492340838]
[2024-11-07 20:59:57,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-07 20:59:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 20:59:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-07 20:59:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-11-07 20:59:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 20:59:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 20:59:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2024-11-07 20:59:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-07 20:59:57,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:57,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492340838]
[2024-11-07 20:59:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492340838] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:57,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 20:59:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666326808]
[2024-11-07 20:59:57,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:57,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 20:59:57,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:57,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 20:59:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 20:59:57,993 INFO L87 Difference]: Start difference. First operand has 183 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 144 states have internal predecessors, (219), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-07 20:59:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:58,027 INFO L93 Difference]: Finished difference Result 349 states and 561 transitions.
[2024-11-07 20:59:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 20:59:58,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71
[2024-11-07 20:59:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:58,036 INFO L225 Difference]: With dead ends: 349
[2024-11-07 20:59:58,036 INFO L226 Difference]: Without dead ends: 177
[2024-11-07 20:59:58,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 20:59:58,044 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:58,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:59:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2024-11-07 20:59:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177.
[2024-11-07 20:59:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.532846715328467) internal successors, (210), 138 states have internal predecessors, (210), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2024-11-07 20:59:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 272 transitions.
[2024-11-07 20:59:58,098 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 272 transitions. Word has length 71
[2024-11-07 20:59:58,098 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:58,098 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 272 transitions.
[2024-11-07 20:59:58,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-07 20:59:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 272 transitions.
[2024-11-07 20:59:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2024-11-07 20:59:58,107 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:58,107 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-11-07 20:59:58,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 20:59:58,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-11-07 20:59:58,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash -380700183, now seen corresponding path program 1 times
[2024-11-07 20:59:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395320598]
[2024-11-07 20:59:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-07 20:59:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 20:59:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-07 20:59:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-11-07 20:59:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 20:59:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 20:59:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2024-11-07 20:59:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-07 20:59:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:58,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395320598]
[2024-11-07 20:59:58,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395320598] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 20:59:58,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949165410]
[2024-11-07 20:59:58,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:58,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:59:58,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:59:58,472 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:58,473 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:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 20:59:58,677 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 20:59:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 20:59:58,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 20:59:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949165410] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:58,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 20:59:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9
[2024-11-07 20:59:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111251628]
[2024-11-07 20:59:58,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:58,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 20:59:58,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:58,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 20:59:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-07 20:59:58,799 INFO L87 Difference]: Start difference. First operand 177 states and 272 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-07 20:59:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:59,017 INFO L93 Difference]: Finished difference Result 389 states and 588 transitions.
[2024-11-07 20:59:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 20:59:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71
[2024-11-07 20:59:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:59,020 INFO L225 Difference]: With dead ends: 389
[2024-11-07 20:59:59,021 INFO L226 Difference]: Without dead ends: 229
[2024-11-07 20:59:59,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-11-07 20:59:59,023 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 392 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:59,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 710 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 20:59:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states.
[2024-11-07 20:59:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226.
[2024-11-07 20:59:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 179 states have (on average 1.5139664804469273) internal successors, (271), 180 states have internal predecessors, (271), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35)
[2024-11-07 20:59:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 341 transitions.
[2024-11-07 20:59:59,060 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 341 transitions. Word has length 71
[2024-11-07 20:59:59,060 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:59,060 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 341 transitions.
[2024-11-07 20:59:59,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-07 20:59:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 341 transitions.
[2024-11-07 20:59:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2024-11-07 20:59:59,063 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:59,063 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-11-07 20:59:59,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 20:59:59,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:59:59,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-11-07 20:59:59,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1753495535, now seen corresponding path program 1 times
[2024-11-07 20:59:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:59,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162765084]
[2024-11-07 20:59:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:59,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-07 20:59:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 20:59:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31
[2024-11-07 20:59:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:59,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2024-11-07 20:59:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 20:59:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 20:59:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:59,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-11-07 20:59:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:59,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 20:59:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-07 20:59:59,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:59,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162765084]
[2024-11-07 20:59:59,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162765084] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 20:59:59,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700934543]
[2024-11-07 20:59:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:59,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:59:59,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:59:59,473 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:59,475 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:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:59,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 20:59:59,644 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 20:59:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 20:59:59,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 20:59:59,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700934543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:59,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 20:59:59,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9
[2024-11-07 20:59:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844310236]
[2024-11-07 20:59:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:59,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 20:59:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:59,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 20:59:59,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-07 20:59:59,730 INFO L87 Difference]: Start difference. First operand 226 states and 341 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-07 20:59:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:59,896 INFO L93 Difference]: Finished difference Result 389 states and 586 transitions.
[2024-11-07 20:59:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 20:59:59,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 72
[2024-11-07 20:59:59,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:59,902 INFO L225 Difference]: With dead ends: 389
[2024-11-07 20:59:59,902 INFO L226 Difference]: Without dead ends: 229
[2024-11-07 20:59:59,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-11-07 20:59:59,904 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 389 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:59,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 713 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 20:59:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states.
[2024-11-07 20:59:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226.
[2024-11-07 20:59:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 179 states have (on average 1.5083798882681565) internal successors, (270), 180 states have internal predecessors, (270), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35)
[2024-11-07 20:59:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 340 transitions.
[2024-11-07 20:59:59,943 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 340 transitions. Word has length 72
[2024-11-07 20:59:59,944 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:59,945 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 340 transitions.
[2024-11-07 20:59:59,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-07 20:59:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 340 transitions.
[2024-11-07 20:59:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2024-11-07 20:59:59,947 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:59,947 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-11-07 20:59:59,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-07 21:00:00,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 21:00:00,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-11-07 21:00:00,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 21:00:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 435875836, now seen corresponding path program 1 times
[2024-11-07 21:00:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 21:00:00,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344666603]
[2024-11-07 21:00:00,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 21:00:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 21:00:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-07 21:00:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:00,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 21:00:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 21:00:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:00,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 21:00:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:00,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-07 21:00:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:00,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 21:00:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:00,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58
[2024-11-07 21:00:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 21:00:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-07 21:00:00,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 21:00:00,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344666603]
[2024-11-07 21:00:00,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344666603] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 21:00:00,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237431737]
[2024-11-07 21:00:00,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 21:00:00,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 21:00:00,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 21:00:00,367 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 21:00:00,369 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 21:00:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:00,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 21:00:00,532 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 21:00:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-07 21:00:00,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 21:00:00,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237431737] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 21:00:00,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 21:00:00,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2024-11-07 21:00:00,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371786689]
[2024-11-07 21:00:00,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 21:00:00,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 21:00:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 21:00:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 21:00:00,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-07 21:00:00,609 INFO L87 Difference]: Start difference. First operand 226 states and 340 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-07 21:00:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 21:00:00,639 INFO L93 Difference]: Finished difference Result 226 states and 340 transitions.
[2024-11-07 21:00:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 21:00:00,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73
[2024-11-07 21:00:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 21:00:00,642 INFO L225 Difference]: With dead ends: 226
[2024-11-07 21:00:00,642 INFO L226 Difference]: Without dead ends: 225
[2024-11-07 21:00:00,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-07 21:00:00,643 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 105 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 21:00:00,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 639 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 21:00:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states.
[2024-11-07 21:00:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225.
[2024-11-07 21:00:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 179 states have (on average 1.5027932960893855) internal successors, (269), 179 states have internal predecessors, (269), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35)
[2024-11-07 21:00:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 339 transitions.
[2024-11-07 21:00:00,684 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 339 transitions. Word has length 73
[2024-11-07 21:00:00,684 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 21:00:00,684 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 339 transitions.
[2024-11-07 21:00:00,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-07 21:00:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 339 transitions.
[2024-11-07 21:00:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2024-11-07 21:00:00,685 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 21:00:00,685 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-11-07 21:00:00,703 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 21:00:00,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 21:00:00,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-11-07 21:00:00,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 21:00:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 627249540, now seen corresponding path program 1 times
[2024-11-07 21:00:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 21:00:00,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722732396]
[2024-11-07 21:00:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 21:00:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 21:00:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-07 21:00:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 21:00:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 21:00:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 21:00:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-07 21:00:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 21:00:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58
[2024-11-07 21:00:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 21:00:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-07 21:00:01,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 21:00:01,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722732396]
[2024-11-07 21:00:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722732396] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 21:00:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811529991]
[2024-11-07 21:00:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 21:00:01,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 21:00:01,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 21:00:01,063 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 21:00:01,065 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 21:00:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 21:00:01,221 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 21:00:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-07 21:00:01,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 21:00:01,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811529991] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 21:00:01,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 21:00:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2024-11-07 21:00:01,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736808815]
[2024-11-07 21:00:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 21:00:01,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 21:00:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 21:00:01,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 21:00:01,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-07 21:00:01,294 INFO L87 Difference]: Start difference. First operand 225 states and 339 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-07 21:00:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 21:00:01,356 INFO L93 Difference]: Finished difference Result 306 states and 471 transitions.
[2024-11-07 21:00:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 21:00:01,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74
[2024-11-07 21:00:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 21:00:01,361 INFO L225 Difference]: With dead ends: 306
[2024-11-07 21:00:01,361 INFO L226 Difference]: Without dead ends: 305
[2024-11-07 21:00:01,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-07 21:00:01,363 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 99 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 21:00:01,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 796 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 21:00:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2024-11-07 21:00:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305.
[2024-11-07 21:00:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 236 states have (on average 1.5) internal successors, (354), 236 states have internal predecessors, (354), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58)
[2024-11-07 21:00:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 470 transitions.
[2024-11-07 21:00:01,389 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 470 transitions. Word has length 74
[2024-11-07 21:00:01,389 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 21:00:01,390 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 470 transitions.
[2024-11-07 21:00:01,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-07 21:00:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 470 transitions.
[2024-11-07 21:00:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2024-11-07 21:00:01,392 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 21:00:01,392 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 21:00:01,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-11-07 21:00:01,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 21:00:01,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-11-07 21:00:01,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 21:00:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -553442180, now seen corresponding path program 1 times
[2024-11-07 21:00:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 21:00:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793123473]
[2024-11-07 21:00:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 21:00:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 21:00:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-07 21:00:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 21:00:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 21:00:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 21:00:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-07 21:00:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 21:00:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58
[2024-11-07 21:00:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 21:00:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-07 21:00:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-07 21:00:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 21:00:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2024-11-07 21:00:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 21:00:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-07 21:00:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128
[2024-11-07 21:00:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked.
[2024-11-07 21:00:01,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 21:00:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793123473]
[2024-11-07 21:00:01,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793123473] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 21:00:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160172918]
[2024-11-07 21:00:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 21:00:01,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 21:00:01,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 21:00:01,847 INFO L229 MonitoredProcess]: Starting monitored process 6 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 21:00:01,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-07 21:00:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 21:00:02,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 21:00:02,064 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 21:00:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2024-11-07 21:00:02,212 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 21:00:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2024-11-07 21:00:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160172918] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 21:00:02,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 21:00:02,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14
[2024-11-07 21:00:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72142347]
[2024-11-07 21:00:02,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 21:00:02,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-07 21:00:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 21:00:02,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 21:00:02,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182
[2024-11-07 21:00:02,416 INFO L87 Difference]: Start difference. First operand 305 states and 470 transitions. Second operand has 14 states, 13 states have (on average 13.307692307692308) internal successors, (173), 14 states have internal predecessors, (173), 7 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 6 states have call predecessors, (37), 7 states have call successors, (37)
[2024-11-07 21:00:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 21:00:02,703 INFO L93 Difference]: Finished difference Result 709 states and 1101 transitions.
[2024-11-07 21:00:02,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-07 21:00:02,704 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.307692307692308) internal successors, (173), 14 states have internal predecessors, (173), 7 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 6 states have call predecessors, (37), 7 states have call successors, (37) Word has length 136
[2024-11-07 21:00:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 21:00:02,704 INFO L225 Difference]: With dead ends: 709
[2024-11-07 21:00:02,704 INFO L226 Difference]: Without dead ends: 0
[2024-11-07 21:00:02,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182
[2024-11-07 21:00:02,707 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 537 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 21:00:02,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 2148 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 21:00:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-07 21:00:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-07 21:00:02,710 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 21:00:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-07 21:00:02,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136
[2024-11-07 21:00:02,711 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 21:00:02,711 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-07 21:00:02,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.307692307692308) internal successors, (173), 14 states have internal predecessors, (173), 7 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 6 states have call predecessors, (37), 7 states have call successors, (37)
[2024-11-07 21:00:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-07 21:00:02,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-07 21:00:02,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining)
[2024-11-07 21:00:02,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining)
[2024-11-07 21:00:02,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-07 21:00:02,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 21:00:02,919 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-11-07 21:00:02,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-07 21:00:03,552 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 21:00:03,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:00:03 BoogieIcfgContainer
[2024-11-07 21:00:03,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 21:00:03,589 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 21:00:03,589 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 21:00:03,589 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 21:00:03,590 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:57" (3/4) ...
[2024-11-07 21:00:03,592 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-07 21:00:03,598 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_manual_selection_history
[2024-11-07 21:00:03,598 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure flip_the_side
[2024-11-07 21:00:03,598 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side2_failed_history
[2024-11-07 21:00:03,599 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert
[2024-11-07 21:00:03,599 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side1_failed_history
[2024-11-07 21:00:03,599 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not
[2024-11-07 21:00:03,599 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_active_side_history
[2024-11-07 21:00:03,611 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges
[2024-11-07 21:00:03,614 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-07 21:00:03,615 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-07 21:00:03,616 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-07 21:00:03,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 21:00:03,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-07 21:00:03,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 21:00:03,731 INFO L158 Benchmark]: Toolchain (without parser) took 7497.77ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 76.5MB in the beginning and 114.7MB in the end (delta: -38.2MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB.
[2024-11-07 21:00:03,732 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 21:00:03,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.71ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 58.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 21:00:03,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.67ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 55.4MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 21:00:03,733 INFO L158 Benchmark]: Boogie Preprocessor took 72.24ms. Allocated memory is still 100.7MB. Free memory was 55.2MB in the beginning and 51.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 21:00:03,733 INFO L158 Benchmark]: RCFGBuilder took 777.64ms. Allocated memory is still 100.7MB. Free memory was 51.3MB in the beginning and 47.7MB in the end (delta: 3.6MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB.
[2024-11-07 21:00:03,734 INFO L158 Benchmark]: TraceAbstraction took 6092.26ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 47.2MB in the beginning and 50.9MB in the end (delta: -3.6MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB.
[2024-11-07 21:00:03,734 INFO L158 Benchmark]: Witness Printer took 141.78ms. Allocated memory is still 151.0MB. Free memory was 50.9MB in the beginning and 114.7MB in the end (delta: -63.8MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB.
[2024-11-07 21:00:03,735 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.28ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 329.71ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 58.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 78.67ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 55.4MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 72.24ms. Allocated memory is still 100.7MB. Free memory was 55.2MB in the beginning and 51.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 777.64ms. Allocated memory is still 100.7MB. Free memory was 51.3MB in the beginning and 47.7MB in the end (delta: 3.6MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 6092.26ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 47.2MB in the beginning and 50.9MB in the end (delta: -3.6MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB.
* Witness Printer took 141.78ms. Allocated memory is still 151.0MB. Free memory was 50.9MB in the beginning and 114.7MB in the end (delta: -63.8MB). Peak memory consumption was 8.5MB. 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: 598]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 598]: 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 8 procedures, 183 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1624 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1522 mSDsluCounter, 5283 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3730 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 368 IncrementalHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 1553 mSDtfsCounter, 368 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 699 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 923 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1047 ConstructedInterpolants, 0 QuantifiedInterpolants, 1733 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2508 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 244/330 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
2 specifications checked. All of them hold
- InvariantResult [Line: 574]: Loop Invariant
Derived loop invariant: (((0 <= i2) && (i2 <= 2147483646)) && (((short) nomsg + 1) <= 0))
- ProcedureContractResult [Line: 173]: Procedure Contract for read_manual_selection_history
Derived contract for procedure read_manual_selection_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2))))
- ProcedureContractResult [Line: 236]: Procedure Contract for flip_the_side
Derived contract for procedure flip_the_side. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2))))
- ProcedureContractResult [Line: 113]: Procedure Contract for read_side2_failed_history
Derived contract for procedure read_side2_failed_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2))))
- ProcedureContractResult [Line: 604]: Procedure Contract for assert
Derived contract for procedure assert. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2))))
- ProcedureContractResult [Line: 83]: Procedure Contract for read_side1_failed_history
Derived contract for procedure read_side1_failed_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2))))
- ProcedureContractResult [Line: 57]: Procedure Contract for assume_abort_if_not
Derived contract for procedure assume_abort_if_not. Requires: (((short) nomsg + 1) <= 0) Ensures: (((cond != 0) && (((short) nomsg + 1) <= 0)) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2))))
- ProcedureContractResult [Line: 143]: Procedure Contract for read_active_side_history
Derived contract for procedure read_active_side_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2))))
RESULT: Ultimate proved your program to be correct!
[2024-11-07 21:00:03,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE