./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-pthread/cs_lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_lamport.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:54:57,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:54:57,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:54:57,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:54:57,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:54:57,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:54:57,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:54:57,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:54:57,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:54:57,390 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:54:57,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:54:57,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:54:57,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:54:57,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:54:57,393 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:54:57,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:54:57,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:54:57,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:54:57,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:54:57,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:54:57,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:54:57,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:54:57,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:54:57,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:54:57,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:54:57,399 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:54:57,400 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:54:57,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:54:57,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:54:57,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:54:57,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:54:57,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:54:57,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:54:57,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:54:57,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:54:57,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:54:57,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:54:57,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:54:57,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:54:57,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:54:57,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:54:57,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:54:57,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:54:57,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:54:57,404 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 [2024-11-12 17:54:57,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:54:57,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:54:57,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:54:57,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:54:57,688 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:54:57,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lamport.i [2024-11-12 17:54:59,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:54:59,397 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:54:59,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lamport.i [2024-11-12 17:54:59,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3f586848/2e7d65cafc3d4b74bf13802a30c9e9f1/FLAG1c01b0270 [2024-11-12 17:54:59,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3f586848/2e7d65cafc3d4b74bf13802a30c9e9f1 [2024-11-12 17:54:59,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:54:59,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:54:59,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:54:59,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:54:59,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:54:59,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:54:59" (1/1) ... [2024-11-12 17:54:59,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de5d964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:59, skipping insertion in model container [2024-11-12 17:54:59,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:54:59" (1/1) ... [2024-11-12 17:54:59,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:54:59,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:54:59,965 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:55:00,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:55:00,092 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:55:00,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00 WrapperNode [2024-11-12 17:55:00,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:55:00,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:55:00,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:55:00,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:55:00,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,179 INFO L138 Inliner]: procedures = 145, calls = 361, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 483 [2024-11-12 17:55:00,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:55:00,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:55:00,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:55:00,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:55:00,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,246 INFO L175 MemorySlicer]: Split 168 memory accesses to 20 slices as follows [2, 13, 5, 8, 5, 8, 8, 29, 21, 7, 7, 7, 7, 7, 5, 5, 5, 0, 13, 6]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 0, 0, 3, 0, 3, 3, 9, 9, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 2]. The 42 writes are split as follows [0, 1, 1, 2, 1, 2, 2, 11, 6, 2, 2, 2, 2, 2, 1, 1, 1, 0, 1, 2]. [2024-11-12 17:55:00,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:55:00,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:55:00,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:55:00,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:55:00,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:55:00,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:00,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 17:55:00,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 17:55:00,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 17:55:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 17:55:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 17:55:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 17:55:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 17:55:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 17:55:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-12 17:55:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-12 17:55:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-12 17:55:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-12 17:55:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-12 17:55:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-12 17:55:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-12 17:55:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-12 17:55:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-12 17:55:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-12 17:55:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-12 17:55:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-11-12 17:55:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-11-12 17:55:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-12 17:55:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 17:55:00,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 17:55:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 17:55:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 17:55:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 17:55:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 17:55:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-12 17:55:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-12 17:55:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-12 17:55:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-12 17:55:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-12 17:55:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-12 17:55:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-12 17:55:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-12 17:55:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-12 17:55:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-12 17:55:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-12 17:55:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-11-12 17:55:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-11-12 17:55:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-11-12 17:55:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-11-12 17:55:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-11-12 17:55:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-12 17:55:00,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-12 17:55:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 17:55:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 17:55:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 17:55:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 17:55:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-12 17:55:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-12 17:55:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-11-12 17:55:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-11-12 17:55:00,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-11-12 17:55:00,430 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-12 17:55:00,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-12 17:55:00,430 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-12 17:55:00,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-12 17:55:00,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 17:55:00,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 17:55:00,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 17:55:00,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 17:55:00,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-12 17:55:00,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-12 17:55:00,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-12 17:55:00,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-12 17:55:00,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-12 17:55:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-12 17:55:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-12 17:55:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-12 17:55:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-12 17:55:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-12 17:55:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-12 17:55:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-11-12 17:55:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-11-12 17:55:00,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-11-12 17:55:00,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-11-12 17:55:00,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-11-12 17:55:00,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-11-12 17:55:00,434 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-12 17:55:00,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-12 17:55:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-12 17:55:00,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-12 17:55:00,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-12 17:55:00,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-12 17:55:00,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-12 17:55:00,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-12 17:55:00,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-12 17:55:00,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-12 17:55:00,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:55:00,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:55:00,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:55:00,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:55:05,472 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-12 17:55:05,472 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:55:05,488 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:55:05,488 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 17:55:05,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:55:05 BoogieIcfgContainer [2024-11-12 17:55:05,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:55:05,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:55:05,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:55:05,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:55:05,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:54:59" (1/3) ... [2024-11-12 17:55:05,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6438c168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:55:05, skipping insertion in model container [2024-11-12 17:55:05,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (2/3) ... [2024-11-12 17:55:05,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6438c168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:55:05, skipping insertion in model container [2024-11-12 17:55:05,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:55:05" (3/3) ... [2024-11-12 17:55:05,498 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_lamport.i [2024-11-12 17:55:05,515 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:55:05,515 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 17:55:05,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:55:05,585 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;@370f394b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:55:05,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-12 17:55:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 91 states have internal predecessors, (114), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 17:55:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:55:05,595 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:05,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:55:05,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:55:05,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash -772365196, now seen corresponding path program 1 times [2024-11-12 17:55:05,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:05,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967675993] [2024-11-12 17:55:05,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:55:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967675993] [2024-11-12 17:55:05,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967675993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:05,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:05,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:55:05,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177012973] [2024-11-12 17:55:05,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:05,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 17:55:05,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 17:55:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 17:55:05,977 INFO L87 Difference]: Start difference. First operand has 133 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 91 states have internal predecessors, (114), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-12 17:55:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:06,012 INFO L93 Difference]: Finished difference Result 259 states and 403 transitions. [2024-11-12 17:55:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 17:55:06,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 17:55:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:06,019 INFO L225 Difference]: With dead ends: 259 [2024-11-12 17:55:06,019 INFO L226 Difference]: Without dead ends: 14 [2024-11-12 17:55:06,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-12 17:55:06,027 INFO L435 NwaCegarLoop]: 176 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, 176 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-12 17:55:06,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-12 17:55:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-12 17:55:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 13 states have internal predecessors, (15), 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-12 17:55:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-12 17:55:06,051 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 6 [2024-11-12 17:55:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:06,051 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-12 17:55:06,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-12 17:55:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-12 17:55:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:55:06,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:06,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:55:06,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:55:06,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:55:06,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash -772374806, now seen corresponding path program 1 times [2024-11-12 17:55:06,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:06,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542117514] [2024-11-12 17:55:06,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:06,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:55:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:06,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542117514] [2024-11-12 17:55:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542117514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:06,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:55:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571761378] [2024-11-12 17:55:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:06,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:55:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:55:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:55:06,282 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 17:55:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:06,309 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-12 17:55:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:55:06,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 17:55:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:06,311 INFO L225 Difference]: With dead ends: 28 [2024-11-12 17:55:06,311 INFO L226 Difference]: Without dead ends: 16 [2024-11-12 17:55:06,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:55:06,314 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:06,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-12 17:55:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-12 17:55:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 14 states have internal predecessors, (16), 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-12 17:55:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-12 17:55:06,320 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 6 [2024-11-12 17:55:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:06,321 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-12 17:55:06,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 17:55:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-12 17:55:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:55:06,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:06,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:55:06,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:55:06,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:55:06,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash -772373140, now seen corresponding path program 1 times [2024-11-12 17:55:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:06,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904818400] [2024-11-12 17:55:06,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:06,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:55:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904818400] [2024-11-12 17:55:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904818400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:06,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:06,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:55:06,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288303181] [2024-11-12 17:55:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:06,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:55:06,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:06,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:55:06,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:55:06,521 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-12 17:55:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:06,565 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-12 17:55:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:55:06,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 17:55:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:06,567 INFO L225 Difference]: With dead ends: 20 [2024-11-12 17:55:06,568 INFO L226 Difference]: Without dead ends: 18 [2024-11-12 17:55:06,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:55:06,569 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:06,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:06,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-12 17:55:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-12 17:55:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 17 states have internal predecessors, (19), 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-12 17:55:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-12 17:55:06,575 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 6 [2024-11-12 17:55:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:06,578 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-12 17:55:06,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-12 17:55:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-12 17:55:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 17:55:06,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:06,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:06,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 17:55:06,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:55:06,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1063320998, now seen corresponding path program 1 times [2024-11-12 17:55:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:06,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722716875] [2024-11-12 17:55:06,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:06,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:55:06,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:06,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722716875] [2024-11-12 17:55:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722716875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802974862] [2024-11-12 17:55:06,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:06,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:06,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:06,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:55:06,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 17:55:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:07,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:55:07,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:55:07,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:55:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:55:07,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802974862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:55:07,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:55:07,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-12 17:55:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708133278] [2024-11-12 17:55:07,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:55:07,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 17:55:07,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 17:55:07,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:55:07,205 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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-12 17:55:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:07,287 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-12 17:55:07,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:55:07,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 17:55:07,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:07,289 INFO L225 Difference]: With dead ends: 39 [2024-11-12 17:55:07,290 INFO L226 Difference]: Without dead ends: 23 [2024-11-12 17:55:07,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:55:07,292 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:07,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:55:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-12 17:55:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-12 17:55:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 22 states have internal predecessors, (25), 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-12 17:55:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-11-12 17:55:07,299 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2024-11-12 17:55:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:07,300 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-11-12 17:55:07,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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-12 17:55:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-11-12 17:55:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 17:55:07,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:07,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:07,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 17:55:07,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:07,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:55:07,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1063322664, now seen corresponding path program 1 times [2024-11-12 17:55:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:07,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708323334] [2024-11-12 17:55:07,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:55:07,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:07,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708323334] [2024-11-12 17:55:07,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708323334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:07,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283204850] [2024-11-12 17:55:07,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:07,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:07,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:07,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:55:07,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 17:55:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:07,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:55:07,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:55:08,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:55:08,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283204850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:08,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:55:08,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-12 17:55:08,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150925372] [2024-11-12 17:55:08,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:08,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:55:08,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:08,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:55:08,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:55:08,013 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-12 17:55:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:08,055 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-11-12 17:55:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:55:08,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 17:55:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:08,056 INFO L225 Difference]: With dead ends: 23 [2024-11-12 17:55:08,056 INFO L226 Difference]: Without dead ends: 22 [2024-11-12 17:55:08,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:55:08,058 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:08,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-12 17:55:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-12 17:55:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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-12 17:55:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-12 17:55:08,061 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2024-11-12 17:55:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:08,061 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-12 17:55:08,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-12 17:55:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-12 17:55:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 17:55:08,062 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:08,062 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1] [2024-11-12 17:55:08,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 17:55:08,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:08,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:55:08,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1426249771, now seen corresponding path program 1 times [2024-11-12 17:55:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:08,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403491267] [2024-11-12 17:55:08,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:55:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:08,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403491267] [2024-11-12 17:55:08,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403491267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:08,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:08,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:55:08,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447966740] [2024-11-12 17:55:08,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:08,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:55:08,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:08,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:55:08,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:55:08,419 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-12 17:55:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:08,449 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-12 17:55:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:55:08,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 17:55:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:08,450 INFO L225 Difference]: With dead ends: 22 [2024-11-12 17:55:08,450 INFO L226 Difference]: Without dead ends: 21 [2024-11-12 17:55:08,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:55:08,451 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:08,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-12 17:55:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-12 17:55:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 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-12 17:55:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-12 17:55:08,455 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2024-11-12 17:55:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:08,455 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-12 17:55:08,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-12 17:55:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-12 17:55:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 17:55:08,456 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:08,456 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:08,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 17:55:08,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:55:08,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash -704397026, now seen corresponding path program 2 times [2024-11-12 17:55:08,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:08,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525233167] [2024-11-12 17:55:08,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:08,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 17:55:08,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:08,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525233167] [2024-11-12 17:55:08,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525233167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:08,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:08,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:55:08,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854380736] [2024-11-12 17:55:08,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:08,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:55:08,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:08,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:55:08,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:55:08,623 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-12 17:55:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:08,680 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-11-12 17:55:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:55:08,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-12 17:55:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:08,681 INFO L225 Difference]: With dead ends: 40 [2024-11-12 17:55:08,682 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 17:55:08,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:55:08,683 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:08,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:55:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 17:55:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-12 17:55:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 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-12 17:55:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2024-11-12 17:55:08,692 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 18 [2024-11-12 17:55:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:08,692 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2024-11-12 17:55:08,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-12 17:55:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-11-12 17:55:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 17:55:08,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:08,693 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-12 17:55:08,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 17:55:08,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:55:08,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2131396469, now seen corresponding path program 1 times [2024-11-12 17:55:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:08,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009995341] [2024-11-12 17:55:08,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:08,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-12 17:55:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009995341] [2024-11-12 17:55:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009995341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701331294] [2024-11-12 17:55:09,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:09,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:09,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:09,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:55:09,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 17:55:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:09,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:55:09,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-12 17:55:09,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:55:09,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701331294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:09,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:55:09,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-12 17:55:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479190537] [2024-11-12 17:55:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:09,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:55:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:09,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:55:09,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:55:09,443 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-12 17:55:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:09,515 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-11-12 17:55:09,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:55:09,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-12 17:55:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:09,520 INFO L225 Difference]: With dead ends: 38 [2024-11-12 17:55:09,520 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 17:55:09,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:55:09,521 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:09,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:55:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 17:55:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 17:55:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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-12 17:55:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-11-12 17:55:09,528 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 35 [2024-11-12 17:55:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:09,528 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-11-12 17:55:09,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-12 17:55:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-11-12 17:55:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 17:55:09,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:09,530 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-12 17:55:09,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 17:55:09,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:09,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:55:09,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1648781250, now seen corresponding path program 1 times [2024-11-12 17:55:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:09,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927371494] [2024-11-12 17:55:09,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:09,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-12 17:55:09,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:09,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927371494] [2024-11-12 17:55:09,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927371494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:09,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:09,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:55:09,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29686578] [2024-11-12 17:55:09,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:09,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:55:09,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:09,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:55:09,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:55:09,881 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:55:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:09,910 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-12 17:55:09,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:55:09,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-12 17:55:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:09,911 INFO L225 Difference]: With dead ends: 37 [2024-11-12 17:55:09,911 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:55:09,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:55:09,912 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:09,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:55:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:55:09,912 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-12 17:55:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:55:09,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2024-11-12 17:55:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:09,913 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:55:09,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:55:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:55:09,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:55:09,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-12 17:55:09,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-12 17:55:09,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-12 17:55:09,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-12 17:55:09,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-12 17:55:09,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-12 17:55:09,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-12 17:55:09,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-12 17:55:09,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 17:55:09,920 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:09,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:55:10,057 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:55:10,079 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-12 17:55:10,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-12 17:55:10,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-12 17:55:10,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-12 17:55:10,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-12 17:55:10,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-12 17:55:10,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable __CS_thread_allocated by function __CS_pthread_create [2024-11-12 17:55:10,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable __CS_thread_born_round by function __CS_pthread_create [2024-11-12 17:55:10,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable __CS_thread_status by function __CS_pthread_create [2024-11-12 17:55:10,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable __CS_thread_lockedon by function __CS_pthread_create [2024-11-12 17:55:10,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable x by function __CS_pthread_create [2024-11-12 17:55:10,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable y by function __CS_pthread_create [2024-11-12 17:55:10,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable b1 by function __CS_pthread_create [2024-11-12 17:55:10,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable b2 by function __CS_pthread_create [2024-11-12 17:55:10,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable X by function __CS_pthread_create [2024-11-12 17:55:10,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable __CS_thread by function __CS_pthread_create [2024-11-12 17:55:10,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-12 17:55:10,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-12 17:55:10,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-12 17:55:10,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-12 17:55:10,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-12 17:55:10,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-12 17:55:10,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:55:10 BoogieIcfgContainer [2024-11-12 17:55:10,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:55:10,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:55:10,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:55:10,088 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:55:10,088 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:55:05" (3/4) ... [2024-11-12 17:55:10,091 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:55:10,096 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2024-11-12 17:55:10,096 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-12 17:55:10,096 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2024-11-12 17:55:10,097 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 17:55:10,097 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2024-11-12 17:55:10,105 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2024-11-12 17:55:10,106 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-12 17:55:10,107 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-12 17:55:10,108 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-12 17:55:10,108 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:55:10,256 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:55:10,257 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:55:10,257 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:55:10,258 INFO L158 Benchmark]: Toolchain (without parser) took 10815.21ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 125.4MB in the beginning and 140.2MB in the end (delta: -14.8MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-12 17:55:10,258 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:55:10,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.26ms. Allocated memory is still 159.4MB. Free memory was 125.4MB in the beginning and 93.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-12 17:55:10,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.28ms. Allocated memory is still 159.4MB. Free memory was 93.9MB in the beginning and 88.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 17:55:10,259 INFO L158 Benchmark]: Boogie Preprocessor took 148.80ms. Allocated memory is still 159.4MB. Free memory was 88.7MB in the beginning and 80.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 17:55:10,259 INFO L158 Benchmark]: RCFGBuilder took 5159.89ms. Allocated memory is still 159.4MB. Free memory was 80.3MB in the beginning and 101.6MB in the end (delta: -21.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-12 17:55:10,259 INFO L158 Benchmark]: TraceAbstraction took 4595.00ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 100.4MB in the beginning and 152.8MB in the end (delta: -52.4MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. [2024-11-12 17:55:10,260 INFO L158 Benchmark]: Witness Printer took 169.63ms. Allocated memory is still 203.4MB. Free memory was 152.8MB in the beginning and 140.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 17:55:10,261 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.19ms. Allocated memory is still 121.6MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 649.26ms. Allocated memory is still 159.4MB. Free memory was 125.4MB in the beginning and 93.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.28ms. Allocated memory is still 159.4MB. Free memory was 93.9MB in the beginning and 88.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.80ms. Allocated memory is still 159.4MB. Free memory was 88.7MB in the beginning and 80.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 5159.89ms. Allocated memory is still 159.4MB. Free memory was 80.3MB in the beginning and 101.6MB in the end (delta: -21.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4595.00ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 100.4MB in the beginning and 152.8MB in the end (delta: -52.4MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. * Witness Printer took 169.63ms. Allocated memory is still 203.4MB. Free memory was 152.8MB in the beginning and 140.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable __CS_thread_allocated by function __CS_pthread_create - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable __CS_thread_born_round by function __CS_pthread_create - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable __CS_thread_status by function __CS_pthread_create - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable __CS_thread_lockedon by function __CS_pthread_create - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable x by function __CS_pthread_create - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable y by function __CS_pthread_create - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable b1 by function __CS_pthread_create - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable b2 by function __CS_pthread_create - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable X by function __CS_pthread_create - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable __CS_thread by function __CS_pthread_create - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * 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: 565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 869]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 869]: 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 6 procedures, 133 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 372 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 251 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1585 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 213/265 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((i == 0) && (j == 0)) || ((i == 0) && (1 <= j))) || (((1 <= i) && (i <= 2)) && (j == 0))) || (((1 <= i) && (i <= 2)) && (1 <= j))) - ProcedureContractResult [Line: 642]: Procedure Contract for __CS_pthread_join Derived contract for procedure __CS_pthread_join. Ensures: (((((((((((((((((((__CS_round == \old(__CS_round)) && (__CS_ret_PREEMPTED == \old(__CS_ret_PREEMPTED))) && (__CS_ret_ERROR == \old(__CS_ret_ERROR))) && (__CS_ret_FINISHED == \old(__CS_ret_FINISHED))) && (__CS_thread_index == \old(__CS_thread_index))) && (__CS_thread_allocated == \old(__CS_thread_allocated))) && (__CS_thread_born_round == \old(__CS_thread_born_round))) && (__CS_thread_status == \old(__CS_thread_status))) && (__THREAD_UNUSED == \old(__THREAD_UNUSED))) && (__THREAD_RUNNING == \old(__THREAD_RUNNING))) && (__THREAD_FINISHED == \old(__THREAD_FINISHED))) && (__CS_thread_lockedon == \old(__CS_thread_lockedon))) && (x == \old(x))) && (y == \old(y))) && (b1 == \old(b1))) && (b2 == \old(b2))) && (X == \old(X))) && (__CS_u == \old(__CS_u))) && (__CS_thread == \old(__CS_thread))) - ProcedureContractResult [Line: 664]: Procedure Contract for __CS_pthread_create Derived contract for procedure __CS_pthread_create. Ensures: ((((((((((__CS_round == \old(__CS_round)) && (__CS_ret == \old(__CS_ret))) && (__CS_ret_PREEMPTED == \old(__CS_ret_PREEMPTED))) && (__CS_ret_ERROR == \old(__CS_ret_ERROR))) && (__CS_ret_FINISHED == \old(__CS_ret_FINISHED))) && (__CS_error == \old(__CS_error))) && (__THREAD_UNUSED == \old(__THREAD_UNUSED))) && (__THREAD_RUNNING == \old(__THREAD_RUNNING))) && (__THREAD_FINISHED == \old(__THREAD_FINISHED))) && (__CS_u == \old(__CS_u))) - ProcedureContractResult [Line: 5]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((((((((((__CS_round == \old(__CS_round)) && (__CS_ret == \old(__CS_ret))) && (__CS_ret_PREEMPTED == \old(__CS_ret_PREEMPTED))) && (__CS_ret_ERROR == \old(__CS_ret_ERROR))) && (__CS_ret_FINISHED == \old(__CS_ret_FINISHED))) && (__CS_error == \old(__CS_error))) && (__CS_thread_index == \old(__CS_thread_index))) && (__CS_thread_allocated == \old(__CS_thread_allocated))) && (__CS_thread_born_round == \old(__CS_thread_born_round))) && (__CS_thread_status == \old(__CS_thread_status))) && (__THREAD_UNUSED == \old(__THREAD_UNUSED))) && (__THREAD_RUNNING == \old(__THREAD_RUNNING))) && (__THREAD_FINISHED == \old(__THREAD_FINISHED))) && (__CS_thread_lockedon == \old(__CS_thread_lockedon))) && (x == \old(x))) && (y == \old(y))) && (b1 == \old(b1))) && (b2 == \old(b2))) && (X == \old(X))) && (__CS_u == \old(__CS_u))) && (__CS_thread == \old(__CS_thread))) - ProcedureContractResult [Line: 562]: Procedure Contract for __CS_cs Derived contract for procedure __CS_cs. Ensures: (((((((((((((((((((__CS_ret_PREEMPTED == \old(__CS_ret_PREEMPTED)) && (__CS_ret_ERROR == \old(__CS_ret_ERROR))) && (__CS_ret_FINISHED == \old(__CS_ret_FINISHED))) && (__CS_error == \old(__CS_error))) && (__CS_thread_index == \old(__CS_thread_index))) && (__CS_thread_allocated == \old(__CS_thread_allocated))) && (__CS_thread_born_round == \old(__CS_thread_born_round))) && (__CS_thread_status == \old(__CS_thread_status))) && (__THREAD_UNUSED == \old(__THREAD_UNUSED))) && (__THREAD_RUNNING == \old(__THREAD_RUNNING))) && (__THREAD_FINISHED == \old(__THREAD_FINISHED))) && (__CS_thread_lockedon == \old(__CS_thread_lockedon))) && (x == \old(x))) && (y == \old(y))) && (b1 == \old(b1))) && (b2 == \old(b2))) && (X == \old(X))) && (__CS_u == \old(__CS_u))) && (__CS_thread == \old(__CS_thread))) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:55:10,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE