./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:10:25,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:10:25,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:10:25,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:10:25,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:10:25,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:10:25,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:10:25,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:10:25,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:10:25,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:10:25,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:10:25,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:10:25,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:10:25,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:10:25,779 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:10:25,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:10:25,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:10:25,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:10:25,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:10:25,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:10:25,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:10:25,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:10:25,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:10:25,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:10:25,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:10:25,784 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:10:25,784 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:10:25,784 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:10:25,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:10:25,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:10:25,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:10:25,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:10:25,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:10:25,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:10:25,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:25,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:10:25,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:10:25,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:10:25,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:10:25,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:10:25,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:10:25,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:10:25,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:10:25,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:10:25,796 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-clean/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-clean/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 -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2024-10-11 20:10:26,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:10:26,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:10:26,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:10:26,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:10:26,069 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:10:26,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2024-10-11 20:10:27,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:10:27,665 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:10:27,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2024-10-11 20:10:27,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ab4010906/b07b1295693b4e8c925efcce71ba6ae2/FLAG158528177 [2024-10-11 20:10:27,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ab4010906/b07b1295693b4e8c925efcce71ba6ae2 [2024-10-11 20:10:27,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:10:27,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:10:27,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:10:27,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:10:27,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:10:27,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:27,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32df786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27, skipping insertion in model container [2024-10-11 20:10:27,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:27,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:10:27,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:10:27,888 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:10:27,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:10:27,915 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:10:27,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27 WrapperNode [2024-10-11 20:10:27,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:10:27,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:10:27,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:10:27,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:10:27,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:27,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:27,974 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2024-10-11 20:10:27,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:10:27,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:10:27,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:10:27,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:10:27,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:27,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:27,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:28,031 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:10:28,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:28,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:28,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:28,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:28,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:28,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:28,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:10:28,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:10:28,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:10:28,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:10:28,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (1/1) ... [2024-10-11 20:10:28,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:28,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:28,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:10:28,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:10:28,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:10:28,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:10:28,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:10:28,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:10:28,190 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:10:28,192 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:10:28,358 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 20:10:28,358 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:10:28,391 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:10:28,391 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:10:28,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:28 BoogieIcfgContainer [2024-10-11 20:10:28,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:10:28,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:10:28,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:10:28,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:10:28,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:10:27" (1/3) ... [2024-10-11 20:10:28,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f8bdf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:10:28, skipping insertion in model container [2024-10-11 20:10:28,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:27" (2/3) ... [2024-10-11 20:10:28,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f8bdf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:10:28, skipping insertion in model container [2024-10-11 20:10:28,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:28" (3/3) ... [2024-10-11 20:10:28,404 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2024-10-11 20:10:28,422 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:10:28,422 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 20:10:28,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:10:28,502 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;@1334a0de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:10:28,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 20:10:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.736842105263158) internal successors, (33), 26 states have internal predecessors, (33), 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-10-11 20:10:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:10:28,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:28,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:10:28,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-10-11 20:10:28,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 100297, now seen corresponding path program 1 times [2024-10-11 20:10:28,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:28,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766553899] [2024-10-11 20:10:28,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:28,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:28,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766553899] [2024-10-11 20:10:28,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766553899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:28,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:28,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626123267] [2024-10-11 20:10:28,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:28,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:28,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:28,756 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.736842105263158) internal successors, (33), 26 states have internal predecessors, (33), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-11 20:10:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:28,814 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-11 20:10:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:28,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-11 20:10:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:28,824 INFO L225 Difference]: With dead ends: 32 [2024-10-11 20:10:28,825 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 20:10:28,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:28,831 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:28,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 21 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 20:10:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-10-11 20:10:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.375) internal successors, (22), 17 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-10-11 20:10:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-11 20:10:28,858 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 3 [2024-10-11 20:10:28,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:28,859 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-11 20:10:28,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-11 20:10:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-11 20:10:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:10:28,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:28,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:10:28,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:10:28,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-10-11 20:10:28,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash 96386895, now seen corresponding path program 1 times [2024-10-11 20:10:28,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:28,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178459039] [2024-10-11 20:10:28,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:28,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:28,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178459039] [2024-10-11 20:10:28,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178459039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:28,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:28,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:28,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368479087] [2024-10-11 20:10:28,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:28,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:28,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:28,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:28,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:28,919 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10-11 20:10:28,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:28,935 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-11 20:10:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:28,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-11 20:10:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:28,936 INFO L225 Difference]: With dead ends: 22 [2024-10-11 20:10:28,936 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 20:10:28,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:28,938 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:28,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 20:10:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 20:10:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-11 20:10:28,946 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 5 [2024-10-11 20:10:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:28,947 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-11 20:10:28,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10-11 20:10:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-11 20:10:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:10:28,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:28,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:10:28,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:10:28,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-10-11 20:10:28,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:28,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1306971670, now seen corresponding path program 1 times [2024-10-11 20:10:28,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:28,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335216912] [2024-10-11 20:10:28,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:29,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:29,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335216912] [2024-10-11 20:10:29,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335216912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:29,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:29,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:29,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129514885] [2024-10-11 20:10:29,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:29,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:29,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:29,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:29,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:29,030 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 2 states have (on average 3.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-10-11 20:10:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:29,056 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-10-11 20:10:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:29,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-10-11 20:10:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:29,058 INFO L225 Difference]: With dead ends: 20 [2024-10-11 20:10:29,059 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 20:10:29,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:29,061 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:29,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 20:10:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-11 20:10:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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-10-11 20:10:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-11 20:10:29,070 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 6 [2024-10-11 20:10:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:29,072 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-11 20:10:29,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-10-11 20:10:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-11 20:10:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:10:29,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:29,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:29,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:10:29,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-10-11 20:10:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1861416052, now seen corresponding path program 1 times [2024-10-11 20:10:29,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363608628] [2024-10-11 20:10:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:29,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:29,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363608628] [2024-10-11 20:10:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363608628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:29,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:29,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534737175] [2024-10-11 20:10:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:29,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:29,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:29,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:29,205 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-10-11 20:10:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:29,233 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2024-10-11 20:10:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:29,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-11 20:10:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:29,234 INFO L225 Difference]: With dead ends: 51 [2024-10-11 20:10:29,235 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 20:10:29,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:29,237 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:29,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 20:10:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2024-10-11 20:10:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-10-11 20:10:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-11 20:10:29,242 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 7 [2024-10-11 20:10:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:29,242 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-11 20:10:29,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-10-11 20:10:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-11 20:10:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:10:29,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:29,243 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:29,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:10:29,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-10-11 20:10:29,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2101982206, now seen corresponding path program 1 times [2024-10-11 20:10:29,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:29,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599188047] [2024-10-11 20:10:29,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:29,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:29,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599188047] [2024-10-11 20:10:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599188047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:29,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:10:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356824816] [2024-10-11 20:10:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:10:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:29,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:10:29,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:10:29,524 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-10-11 20:10:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:29,581 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-11 20:10:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:10:29,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-10-11 20:10:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:29,582 INFO L225 Difference]: With dead ends: 49 [2024-10-11 20:10:29,584 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 20:10:29,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:10:29,586 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:29,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 32 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 20:10:29,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2024-10-11 20:10:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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-10-11 20:10:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-11 20:10:29,595 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2024-10-11 20:10:29,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:29,595 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-11 20:10:29,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-10-11 20:10:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-11 20:10:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:10:29,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:29,597 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:29,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:10:29,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-10-11 20:10:29,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:29,598 INFO L85 PathProgramCache]: Analyzing trace with hash -285579451, now seen corresponding path program 1 times [2024-10-11 20:10:29,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:29,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247442725] [2024-10-11 20:10:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:10:29,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 20:10:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:10:29,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 20:10:29,654 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 20:10:29,655 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2024-10-11 20:10:29,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2024-10-11 20:10:29,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 7 remaining) [2024-10-11 20:10:29,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2024-10-11 20:10:29,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2024-10-11 20:10:29,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2024-10-11 20:10:29,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2024-10-11 20:10:29,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:10:29,662 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 20:10:29,683 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:10:29,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:10:29 BoogieIcfgContainer [2024-10-11 20:10:29,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:10:29,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:10:29,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:10:29,691 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:10:29,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:28" (3/4) ... [2024-10-11 20:10:29,694 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 20:10:29,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:10:29,696 INFO L158 Benchmark]: Toolchain (without parser) took 2006.61ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 86.7MB in the beginning and 139.5MB in the end (delta: -52.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:29,696 INFO L158 Benchmark]: CDTParser took 2.11ms. Allocated memory is still 159.4MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:29,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.74ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 74.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:10:29,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.46ms. Allocated memory is still 159.4MB. Free memory was 74.7MB in the beginning and 129.5MB in the end (delta: -54.8MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-10-11 20:10:29,698 INFO L158 Benchmark]: Boogie Preprocessor took 75.49ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 129.5MB in the beginning and 180.7MB in the end (delta: -51.2MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. [2024-10-11 20:10:29,698 INFO L158 Benchmark]: RCFGBuilder took 340.54ms. Allocated memory is still 209.7MB. Free memory was 180.7MB in the beginning and 166.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:10:29,698 INFO L158 Benchmark]: TraceAbstraction took 1295.08ms. Allocated memory is still 209.7MB. Free memory was 166.0MB in the beginning and 140.5MB in the end (delta: 25.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-10-11 20:10:29,698 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 209.7MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:29,700 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.11ms. Allocated memory is still 159.4MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.74ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 74.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.46ms. Allocated memory is still 159.4MB. Free memory was 74.7MB in the beginning and 129.5MB in the end (delta: -54.8MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.49ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 129.5MB in the beginning and 180.7MB in the end (delta: -51.2MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. * RCFGBuilder took 340.54ms. Allocated memory is still 209.7MB. Free memory was 180.7MB in the beginning and 166.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1295.08ms. Allocated memory is still 209.7MB. Free memory was 166.0MB in the beginning and 140.5MB in the end (delta: 25.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 209.7MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of shiftLeft at line 32, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L24] unsigned char x; [L25] unsigned char y; [L26] unsigned char c; [L28] x = 37 [L29] y = 0 [L30] c = 0 VAL [c=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 VAL [c=0, x=37, y=0] [L32] EXPR ((unsigned char)1) << c [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=0, i=1, x=37, y=0] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=0, i=1, x=37, y=0] [L37] EXPR c + ((unsigned char)1) [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=1, x=37, y=0] [L32] ((unsigned char)1) << c VAL [c=1, x=37, y=0] - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 85 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 20:10:29,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:10:31,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:10:31,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-10-11 20:10:31,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:10:31,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:10:31,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:10:31,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:10:31,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:10:31,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:10:31,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:10:31,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:10:31,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:10:31,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:10:31,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:10:31,962 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:10:31,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:10:31,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:10:31,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:10:31,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:10:31,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:10:31,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:10:31,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:10:31,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:10:31,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 20:10:31,966 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 20:10:31,966 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:10:31,967 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:10:31,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 20:10:31,967 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:10:31,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:10:31,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:10:31,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:10:31,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:10:31,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:10:31,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:10:31,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:10:31,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:31,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:10:31,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:10:31,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:10:31,972 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 20:10:31,972 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 20:10:31,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:10:31,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:10:31,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:10:31,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:10:31,973 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 20:10:31,974 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-clean/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-clean/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 -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2024-10-11 20:10:32,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:10:32,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:10:32,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:10:32,316 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:10:32,317 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:10:32,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2024-10-11 20:10:33,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:10:34,100 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:10:34,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2024-10-11 20:10:34,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6426d2889/46c3df8218174f4d995da5d177d8a1f4/FLAGdddc69ff9 [2024-10-11 20:10:34,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6426d2889/46c3df8218174f4d995da5d177d8a1f4 [2024-10-11 20:10:34,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:10:34,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:10:34,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:10:34,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:10:34,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:10:34,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75572422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34, skipping insertion in model container [2024-10-11 20:10:34,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:10:34,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:10:34,723 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:10:34,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:10:34,762 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:10:34,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34 WrapperNode [2024-10-11 20:10:34,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:10:34,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:10:34,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:10:34,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:10:34,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,794 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2024-10-11 20:10:34,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:10:34,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:10:34,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:10:34,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:10:34,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,827 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:10:34,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:10:34,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:10:34,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:10:34,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:10:34,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (1/1) ... [2024-10-11 20:10:34,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:34,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:34,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:10:34,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:10:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:10:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:10:34,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:10:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 20:10:34,999 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:10:35,001 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:10:35,199 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 20:10:35,199 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:10:35,231 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:10:35,231 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:10:35,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:35 BoogieIcfgContainer [2024-10-11 20:10:35,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:10:35,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:10:35,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:10:35,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:10:35,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:10:34" (1/3) ... [2024-10-11 20:10:35,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7fe50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:10:35, skipping insertion in model container [2024-10-11 20:10:35,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:34" (2/3) ... [2024-10-11 20:10:35,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7fe50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:10:35, skipping insertion in model container [2024-10-11 20:10:35,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:35" (3/3) ... [2024-10-11 20:10:35,244 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2024-10-11 20:10:35,258 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:10:35,258 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 20:10:35,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:10:35,308 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;@57d85fc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:10:35,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 20:10:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:10:35,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:35,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:10:35,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-10-11 20:10:35,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:35,323 INFO L85 PathProgramCache]: Analyzing trace with hash 81077, now seen corresponding path program 1 times [2024-10-11 20:10:35,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:10:35,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456666221] [2024-10-11 20:10:35,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:35,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:35,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:10:35,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 20:10:35,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 20:10:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:35,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:10:35,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:35,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:35,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:10:35,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456666221] [2024-10-11 20:10:35,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456666221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:35,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:35,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:10:35,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717281049] [2024-10-11 20:10:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:35,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:10:35,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:35,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:35,480 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 20:10:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:35,542 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-10-11 20:10:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:35,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 20:10:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:35,549 INFO L225 Difference]: With dead ends: 37 [2024-10-11 20:10:35,550 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 20:10:35,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:35,555 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:35,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 20:10:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2024-10-11 20:10:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 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-10-11 20:10:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-10-11 20:10:35,589 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 3 [2024-10-11 20:10:35,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:35,590 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-11 20:10:35,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 20:10:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-10-11 20:10:35,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:10:35,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:35,591 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:35,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:10:35,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:35,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-10-11 20:10:35,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash 91557253, now seen corresponding path program 1 times [2024-10-11 20:10:35,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:10:35,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884648091] [2024-10-11 20:10:35,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:35,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:35,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:10:35,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 20:10:35,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 20:10:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:35,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:10:35,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:35,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:35,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:10:35,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884648091] [2024-10-11 20:10:35,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884648091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:35,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:35,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:10:35,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448863437] [2024-10-11 20:10:35,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:35,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:10:35,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:35,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:35,978 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-10-11 20:10:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:36,032 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-10-11 20:10:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:36,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-10-11 20:10:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:36,033 INFO L225 Difference]: With dead ends: 34 [2024-10-11 20:10:36,033 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 20:10:36,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:10:36,034 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:36,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 15 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 20:10:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2024-10-11 20:10:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2666666666666666) 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-10-11 20:10:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-10-11 20:10:36,039 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2024-10-11 20:10:36,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:36,039 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-10-11 20:10:36,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-10-11 20:10:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-10-11 20:10:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:10:36,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:36,040 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:36,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 20:10:36,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:36,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-10-11 20:10:36,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:36,242 INFO L85 PathProgramCache]: Analyzing trace with hash 850805569, now seen corresponding path program 1 times [2024-10-11 20:10:36,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:10:36,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127393455] [2024-10-11 20:10:36,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:36,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:36,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:10:36,246 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 20:10:36,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 20:10:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:36,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:10:36,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:36,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:10:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:36,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:10:36,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127393455] [2024-10-11 20:10:36,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127393455] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:10:36,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:10:36,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2024-10-11 20:10:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817117417] [2024-10-11 20:10:36,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:10:36,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:10:36,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:10:36,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:10:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:10:36,401 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:36,473 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-10-11 20:10:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:10:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 20:10:36,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:36,475 INFO L225 Difference]: With dead ends: 32 [2024-10-11 20:10:36,476 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:10:36,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:10:36,479 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:36,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 15 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:10:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:10:36,483 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-10-11 20:10:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:10:36,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2024-10-11 20:10:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:36,484 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:10:36,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:10:36,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:10:36,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2024-10-11 20:10:36,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2024-10-11 20:10:36,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 7 remaining) [2024-10-11 20:10:36,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2024-10-11 20:10:36,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2024-10-11 20:10:36,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2024-10-11 20:10:36,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2024-10-11 20:10:36,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 20:10:36,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:36,695 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 20:10:36,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:10:36,724 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:10:36,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:10:36 BoogieIcfgContainer [2024-10-11 20:10:36,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:10:36,745 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:10:36,745 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:10:36,745 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:10:36,746 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:35" (3/4) ... [2024-10-11 20:10:36,748 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:10:36,755 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 20:10:36,755 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:10:36,755 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:10:36,756 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:10:36,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:10:36,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:10:36,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:10:36,856 INFO L158 Benchmark]: Toolchain (without parser) took 2371.02ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 37.0MB in the beginning and 62.6MB in the end (delta: -25.6MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2024-10-11 20:10:36,856 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:36,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.56ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 42.6MB in the end (delta: -5.7MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-10-11 20:10:36,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.77ms. Allocated memory is still 69.2MB. Free memory was 42.6MB in the beginning and 41.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:36,857 INFO L158 Benchmark]: Boogie Preprocessor took 50.24ms. Allocated memory is still 69.2MB. Free memory was 41.0MB in the beginning and 39.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:10:36,857 INFO L158 Benchmark]: RCFGBuilder took 386.11ms. Allocated memory is still 69.2MB. Free memory was 39.1MB in the beginning and 46.2MB in the end (delta: -7.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:10:36,859 INFO L158 Benchmark]: TraceAbstraction took 1508.32ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.4MB in the beginning and 52.1MB in the end (delta: -6.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-10-11 20:10:36,859 INFO L158 Benchmark]: Witness Printer took 110.03ms. Allocated memory is still 83.9MB. Free memory was 52.1MB in the beginning and 62.6MB in the end (delta: -10.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:10:36,861 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.15ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.56ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 42.6MB in the end (delta: -5.7MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.77ms. Allocated memory is still 69.2MB. Free memory was 42.6MB in the beginning and 41.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.24ms. Allocated memory is still 69.2MB. Free memory was 41.0MB in the beginning and 39.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.11ms. Allocated memory is still 69.2MB. Free memory was 39.1MB in the beginning and 46.2MB in the end (delta: -7.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1508.32ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.4MB in the beginning and 52.1MB in the end (delta: -6.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Witness Printer took 110.03ms. Allocated memory is still 83.9MB. Free memory was 52.1MB in the beginning and 62.6MB in the end (delta: -10.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: 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 1 procedures, 21 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 23 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 3 NumberOfNonLiveVariables, 76 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/6 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 7 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (c < 32) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:10:36,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE