./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 58013d922b6ea61b441d7b9812a4ff6f833ad15cea27fa85e4b4fc2ce4889815 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:35:20,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:35:20,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:35:20,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:35:20,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:35:20,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:35:20,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:35:20,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:35:20,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:35:20,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:35:20,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:35:20,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:35:20,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:35:20,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:35:20,987 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:35:20,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:35:20,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:35:20,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:35:20,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:35:20,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:35:20,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:35:20,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:35:20,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:35:20,992 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:35:20,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:35:20,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:35:20,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:35:20,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:35:20,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:35:20,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:35:20,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:35:20,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:35:20,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:35:20,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:35:20,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:35:20,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:35:21,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:35:21,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:35:21,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:35:21,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:35:21,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:35:21,001 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58013d922b6ea61b441d7b9812a4ff6f833ad15cea27fa85e4b4fc2ce4889815 [2024-10-11 22:35:21,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:35:21,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:35:21,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:35:21,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:35:21,329 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:35:21,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_good.i [2024-10-11 22:35:22,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:35:22,898 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:35:22,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_good.i [2024-10-11 22:35:22,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a70dce4a5/fe0416f871074e80ab55c3641addd4e4/FLAGd43e9e3eb [2024-10-11 22:35:23,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a70dce4a5/fe0416f871074e80ab55c3641addd4e4 [2024-10-11 22:35:23,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:35:23,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:35:23,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:35:23,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:35:23,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:35:23,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:35:23" (1/1) ... [2024-10-11 22:35:23,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730397c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:23, skipping insertion in model container [2024-10-11 22:35:23,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:35:23" (1/1) ... [2024-10-11 22:35:23,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:35:23,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:35:23,904 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:35:23,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:35:24,059 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:35:24,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24 WrapperNode [2024-10-11 22:35:24,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:35:24,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:35:24,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:35:24,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:35:24,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,124 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2024-10-11 22:35:24,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:35:24,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:35:24,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:35:24,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:35:24,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,149 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:35:24,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:35:24,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:35:24,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:35:24,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:35:24,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (1/1) ... [2024-10-11 22:35:24,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:35:24,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:35:24,192 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 22:35:24,194 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 22:35:24,227 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:35:24,228 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:35:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:35:24,228 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:35:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:35:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2024-10-11 22:35:24,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2024-10-11 22:35:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:35:24,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:35:24,351 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:35:24,356 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:35:24,577 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-10-11 22:35:24,577 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:35:24,601 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:35:24,601 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:35:24,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:35:24 BoogieIcfgContainer [2024-10-11 22:35:24,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:35:24,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:35:24,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:35:24,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:35:24,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:35:23" (1/3) ... [2024-10-11 22:35:24,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49852ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:35:24, skipping insertion in model container [2024-10-11 22:35:24,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:24" (2/3) ... [2024-10-11 22:35:24,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49852ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:35:24, skipping insertion in model container [2024-10-11 22:35:24,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:35:24" (3/3) ... [2024-10-11 22:35:24,619 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_65_good.i [2024-10-11 22:35:24,635 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:35:24,635 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 22:35:24,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:35:24,686 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;@76cf5725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:35:24,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 22:35:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 47 states have internal predecessors, (63), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 22:35:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:35:24,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:35:24,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:35:24,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:35:24,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:35:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -519865738, now seen corresponding path program 1 times [2024-10-11 22:35:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:35:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757615686] [2024-10-11 22:35:24,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:35:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:35:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:35:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,064 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 22:35:25,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:35:25,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757615686] [2024-10-11 22:35:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757615686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:35:25,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:35:25,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:35:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027359727] [2024-10-11 22:35:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:35:25,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:35:25,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:35:25,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:35:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:35:25,098 INFO L87 Difference]: Start difference. First operand has 58 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 47 states have internal predecessors, (63), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:35:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:35:25,199 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-10-11 22:35:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:35:25,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 22:35:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:35:25,209 INFO L225 Difference]: With dead ends: 78 [2024-10-11 22:35:25,209 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 22:35:25,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 22:35:25,223 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 17 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:35:25,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 328 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:35:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 22:35:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-10-11 22:35:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.4375) internal successors, (69), 51 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:35:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2024-10-11 22:35:25,259 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 11 [2024-10-11 22:35:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:35:25,260 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2024-10-11 22:35:25,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:35:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-10-11 22:35:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:35:25,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:35:25,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:35:25,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:35:25,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:35:25,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:35:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1064014618, now seen corresponding path program 1 times [2024-10-11 22:35:25,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:35:25,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368899028] [2024-10-11 22:35:25,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:35:25,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:35:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:35:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,361 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 22:35:25,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:35:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368899028] [2024-10-11 22:35:25,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368899028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:35:25,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:35:25,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:35:25,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275963949] [2024-10-11 22:35:25,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:35:25,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:35:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:35:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:35:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:35:25,364 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:35:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:35:25,414 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2024-10-11 22:35:25,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:35:25,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 22:35:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:35:25,415 INFO L225 Difference]: With dead ends: 103 [2024-10-11 22:35:25,416 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 22:35:25,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 22:35:25,417 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 13 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:35:25,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 281 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:35:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 22:35:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 22:35:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 50 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 22:35:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2024-10-11 22:35:25,426 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 12 [2024-10-11 22:35:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:35:25,427 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2024-10-11 22:35:25,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:35:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2024-10-11 22:35:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 22:35:25,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:35:25,428 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:35:25,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:35:25,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:35:25,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:35:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1454836485, now seen corresponding path program 1 times [2024-10-11 22:35:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:35:25,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122844939] [2024-10-11 22:35:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:35:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:35:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:35:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:35:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 22:35:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:35:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:35:25,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122844939] [2024-10-11 22:35:25,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122844939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:35:25,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:35:25,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:35:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616912714] [2024-10-11 22:35:25,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:35:25,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:35:25,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:35:25,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:35:25,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:35:25,555 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:35:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:35:25,580 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2024-10-11 22:35:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:35:25,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-11 22:35:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:35:25,582 INFO L225 Difference]: With dead ends: 61 [2024-10-11 22:35:25,582 INFO L226 Difference]: Without dead ends: 57 [2024-10-11 22:35:25,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:35:25,583 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 37 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:35:25,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 139 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:35:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-11 22:35:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-10-11 22:35:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 22:35:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2024-10-11 22:35:25,590 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 29 [2024-10-11 22:35:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:35:25,590 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2024-10-11 22:35:25,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:35:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2024-10-11 22:35:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 22:35:25,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:35:25,591 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:35:25,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:35:25,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:35:25,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:35:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2144725909, now seen corresponding path program 1 times [2024-10-11 22:35:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:35:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807274131] [2024-10-11 22:35:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:35:25,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:35:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:35:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:35:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 22:35:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,711 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 22:35:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:35:25,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807274131] [2024-10-11 22:35:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807274131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:35:25,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:35:25,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:35:25,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449583709] [2024-10-11 22:35:25,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:35:25,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:35:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:35:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:35:25,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:35:25,720 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:35:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:35:25,774 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2024-10-11 22:35:25,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:35:25,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-11 22:35:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:35:25,776 INFO L225 Difference]: With dead ends: 55 [2024-10-11 22:35:25,776 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 22:35:25,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 22:35:25,777 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:35:25,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 293 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:35:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 22:35:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 22:35:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 22:35:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2024-10-11 22:35:25,783 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 30 [2024-10-11 22:35:25,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:35:25,784 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2024-10-11 22:35:25,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:35:25,784 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-10-11 22:35:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 22:35:25,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:35:25,785 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:35:25,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:35:25,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:35:25,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:35:25,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2061993592, now seen corresponding path program 1 times [2024-10-11 22:35:25,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:35:25,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200581590] [2024-10-11 22:35:25,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:35:25,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:35:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:35:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:35:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 22:35:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 22:35:25,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:35:25,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200581590] [2024-10-11 22:35:25,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200581590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:35:25,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:35:25,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:35:25,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436377256] [2024-10-11 22:35:25,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:35:25,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:35:25,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:35:25,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:35:25,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:35:25,829 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:35:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:35:25,840 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2024-10-11 22:35:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:35:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-10-11 22:35:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:35:25,841 INFO L225 Difference]: With dead ends: 54 [2024-10-11 22:35:25,841 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:35:25,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 22:35:25,842 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:35:25,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:35:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:35:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:35:25,843 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 22:35:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:35:25,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2024-10-11 22:35:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:35:25,844 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:35:25,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:35:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:35:25,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:35:25,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 22:35:25,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 22:35:25,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 22:35:25,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 22:35:25,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:35:25,854 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 22:35:25,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:35:25,935 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:35:25,954 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.offset [2024-10-11 22:35:25,955 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:35:25,956 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.base [2024-10-11 22:35:25,956 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:35:25,957 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.offset [2024-10-11 22:35:25,959 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:35:25,959 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.base [2024-10-11 22:35:25,959 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:35:25,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:35:25 BoogieIcfgContainer [2024-10-11 22:35:25,960 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:35:25,960 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:35:25,960 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:35:25,960 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:35:25,961 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:35:24" (3/4) ... [2024-10-11 22:35:25,962 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:35:25,968 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:35:25,968 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:35:25,968 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2024-10-11 22:35:25,972 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-11 22:35:25,973 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 22:35:25,973 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 22:35:26,014 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitnessLocation(YamlCorrectnessWitnessGenerator.java:111) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.extractFunctionContracts(YamlCorrectnessWitnessGenerator.java:104) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitness(YamlCorrectnessWitnessGenerator.java:66) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.makeYamlString(YamlCorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:170) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:140) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:130) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-11 22:35:26,018 INFO L158 Benchmark]: Toolchain (without parser) took 2798.05ms. Allocated memory was 144.7MB in the beginning and 253.8MB in the end (delta: 109.1MB). Free memory was 72.4MB in the beginning and 89.4MB in the end (delta: -17.1MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2024-10-11 22:35:26,019 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 144.7MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:35:26,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 837.28ms. Allocated memory was 144.7MB in the beginning and 253.8MB in the end (delta: 109.1MB). Free memory was 72.2MB in the beginning and 166.8MB in the end (delta: -94.7MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-10-11 22:35:26,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.99ms. Allocated memory is still 253.8MB. Free memory was 166.8MB in the beginning and 163.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:35:26,020 INFO L158 Benchmark]: Boogie Preprocessor took 35.51ms. Allocated memory is still 253.8MB. Free memory was 163.6MB in the beginning and 160.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:35:26,020 INFO L158 Benchmark]: RCFGBuilder took 435.88ms. Allocated memory is still 253.8MB. Free memory was 160.5MB in the beginning and 140.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 22:35:26,021 INFO L158 Benchmark]: TraceAbstraction took 1352.72ms. Allocated memory is still 253.8MB. Free memory was 140.6MB in the beginning and 93.6MB in the end (delta: 47.0MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2024-10-11 22:35:26,021 INFO L158 Benchmark]: Witness Printer took 57.99ms. Allocated memory is still 253.8MB. Free memory was 93.6MB in the beginning and 89.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:35:26,022 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.12ms. Allocated memory is still 144.7MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 837.28ms. Allocated memory was 144.7MB in the beginning and 253.8MB in the end (delta: 109.1MB). Free memory was 72.2MB in the beginning and 166.8MB in the end (delta: -94.7MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.99ms. Allocated memory is still 253.8MB. Free memory was 166.8MB in the beginning and 163.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.51ms. Allocated memory is still 253.8MB. Free memory was 163.6MB in the beginning and 160.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 435.88ms. Allocated memory is still 253.8MB. Free memory was 160.5MB in the beginning and 140.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1352.72ms. Allocated memory is still 253.8MB. Free memory was 140.6MB in the beginning and 93.6MB in the end (delta: 47.0MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * Witness Printer took 57.99ms. Allocated memory is still 253.8MB. Free memory was 93.6MB in the beginning and 89.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base * 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: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: 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 4 procedures, 58 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 1156 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 847 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 309 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=1, InterpolantAutomatonStates: 25, 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, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 7/7 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 4 specifications checked. All of them hold - ProcedureContractResult [Line: -1]: Procedure Contract for ##fun~int~TO~VOID Derived contract for procedure ##fun~int~TO~VOID. Requires: ((0 <= (\old() + 2147483648)) || (2 == \old())) Ensures: ((0 <= (\old() + 2147483648)) || (2 == \old())) * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-11 22:35:26,048 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 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/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 58013d922b6ea61b441d7b9812a4ff6f833ad15cea27fa85e4b4fc2ce4889815 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:35:28,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:35:28,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-11 22:35:28,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:35:28,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:35:28,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-11 22:35:28,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:35:28,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:35:28,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:35:28,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:35:28,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:35:28,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:35:28,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:35:28,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:35:28,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:35:28,308 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:35:28,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:35:28,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:35:28,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:35:28,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:35:28,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:35:28,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:35:28,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 22:35:28,310 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 22:35:28,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:35:28,311 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:35:28,311 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 22:35:28,311 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:35:28,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:35:28,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:35:28,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:35:28,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:35:28,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:35:28,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:35:28,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:35:28,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:35:28,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:35:28,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:35:28,313 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 22:35:28,313 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 22:35:28,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:35:28,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:35:28,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:35:28,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:35:28,314 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 22:35:28,314 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58013d922b6ea61b441d7b9812a4ff6f833ad15cea27fa85e4b4fc2ce4889815 [2024-10-11 22:35:28,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:35:28,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:35:28,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:35:28,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:35:28,663 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:35:28,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_good.i [2024-10-11 22:35:30,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:35:30,642 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:35:30,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_good.i [2024-10-11 22:35:30,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/477da01cc/fa3182f9c5de47009c2636374931f701/FLAG244c03b23 [2024-10-11 22:35:30,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/477da01cc/fa3182f9c5de47009c2636374931f701 [2024-10-11 22:35:30,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:35:30,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:35:30,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:35:30,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:35:30,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:35:30,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:35:30" (1/1) ... [2024-10-11 22:35:30,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414f4d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:30, skipping insertion in model container [2024-10-11 22:35:30,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:35:30" (1/1) ... [2024-10-11 22:35:30,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:35:31,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:35:31,317 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:35:31,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:35:31,503 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:35:31,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31 WrapperNode [2024-10-11 22:35:31,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:35:31,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:35:31,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:35:31,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:35:31,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,560 INFO L138 Inliner]: procedures = 507, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-10-11 22:35:31,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:35:31,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:35:31,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:35:31,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:35:31,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,588 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:35:31,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:35:31,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:35:31,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:35:31,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:35:31,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (1/1) ... [2024-10-11 22:35:31,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:35:31,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:35:31,643 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 22:35:31,646 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 22:35:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:35:31,681 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:35:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:35:31,681 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:35:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:35:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_INT~TO~VOID [2024-10-11 22:35:31,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_INT~TO~VOID [2024-10-11 22:35:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:35:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:35:31,818 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:35:31,820 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:35:31,947 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 22:35:31,947 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:35:31,976 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:35:31,977 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:35:31,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:35:31 BoogieIcfgContainer [2024-10-11 22:35:31,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:35:31,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:35:31,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:35:31,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:35:31,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:35:30" (1/3) ... [2024-10-11 22:35:31,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5112729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:35:31, skipping insertion in model container [2024-10-11 22:35:31,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:35:31" (2/3) ... [2024-10-11 22:35:31,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5112729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:35:31, skipping insertion in model container [2024-10-11 22:35:31,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:35:31" (3/3) ... [2024-10-11 22:35:31,986 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_65_good.i [2024-10-11 22:35:32,001 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:35:32,002 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 22:35:32,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:35:32,079 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;@31674950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:35:32,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 22:35:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 27 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 22:35:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:35:32,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:35:32,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:35:32,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:35:32,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:35:32,097 INFO L85 PathProgramCache]: Analyzing trace with hash -787831618, now seen corresponding path program 1 times [2024-10-11 22:35:32,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:35:32,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442638149] [2024-10-11 22:35:32,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:35:32,115 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 22:35:32,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:35:32,117 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 22:35:32,119 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 22:35:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:32,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 22:35:32,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:35:32,224 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 22:35:32,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:35:32,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:35:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442638149] [2024-10-11 22:35:32,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442638149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:35:32,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:35:32,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 22:35:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282072495] [2024-10-11 22:35:32,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:35:32,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 22:35:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:35:32,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 22:35:32,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:35:32,261 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 27 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:35:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:35:32,288 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-11 22:35:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 22:35:32,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 22:35:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:35:32,297 INFO L225 Difference]: With dead ends: 38 [2024-10-11 22:35:32,297 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 22:35:32,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:35:32,302 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:35:32,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:35:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 22:35:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 22:35:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:35:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-10-11 22:35:32,333 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2024-10-11 22:35:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:35:32,335 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-11 22:35:32,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:35:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-10-11 22:35:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:35:32,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:35:32,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:35:32,343 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 (2)] Ended with exit code 0 [2024-10-11 22:35:32,541 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 22:35:32,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:35:32,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:35:32,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1347023707, now seen corresponding path program 1 times [2024-10-11 22:35:32,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:35:32,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334805215] [2024-10-11 22:35:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:35:32,546 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 22:35:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:35:32,548 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 22:35:32,550 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 22:35:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:32,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 22:35:32,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:35:32,707 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 22:35:32,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:35:32,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:35:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334805215] [2024-10-11 22:35:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334805215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:35:32,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:35:32,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:35:32,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255464823] [2024-10-11 22:35:32,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:35:32,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:35:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:35:32,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:35:32,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:35:32,710 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:35:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:35:32,820 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-10-11 22:35:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:35:32,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 22:35:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:35:32,822 INFO L225 Difference]: With dead ends: 50 [2024-10-11 22:35:32,822 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 22:35:32,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 22:35:32,823 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:35:32,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 144 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:35:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 22:35:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-10-11 22:35:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:35:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-11 22:35:32,830 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 12 [2024-10-11 22:35:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:35:32,830 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-11 22:35:32,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:35:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-11 22:35:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 22:35:32,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:35:32,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:35:32,839 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 22:35:33,032 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 22:35:33,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:35:33,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:35:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1192460287, now seen corresponding path program 1 times [2024-10-11 22:35:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:35:33,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447588272] [2024-10-11 22:35:33,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:35:33,034 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 22:35:33,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:35:33,035 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 22:35:33,038 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 22:35:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:33,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 22:35:33,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:35:33,108 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 22:35:33,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:35:33,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:35:33,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447588272] [2024-10-11 22:35:33,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447588272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:35:33,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:35:33,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:35:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394277209] [2024-10-11 22:35:33,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:35:33,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:35:33,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:35:33,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:35:33,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:35:33,111 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:35:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:35:33,147 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-10-11 22:35:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:35:33,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 22:35:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:35:33,148 INFO L225 Difference]: With dead ends: 60 [2024-10-11 22:35:33,148 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 22:35:33,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:35:33,150 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:35:33,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 60 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:35:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 22:35:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 22:35:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 22:35:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-10-11 22:35:33,158 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 13 [2024-10-11 22:35:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:35:33,158 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-10-11 22:35:33,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:35:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-10-11 22:35:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 22:35:33,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:35:33,162 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:35:33,166 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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 22:35:33,365 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 22:35:33,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:35:33,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:35:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1989314994, now seen corresponding path program 1 times [2024-10-11 22:35:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:35:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193622978] [2024-10-11 22:35:33,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:35:33,369 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 22:35:33,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:35:33,379 INFO L229 MonitoredProcess]: Starting monitored process 5 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 22:35:33,381 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 (5)] Waiting until timeout for monitored process [2024-10-11 22:35:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:33,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 22:35:33,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:35:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:35:33,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:35:33,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:35:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193622978] [2024-10-11 22:35:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193622978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:35:33,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:35:33,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:35:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787245280] [2024-10-11 22:35:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:35:33,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:35:33,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:35:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:35:33,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:35:33,520 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:35:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:35:33,547 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-11 22:35:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:35:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-10-11 22:35:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:35:33,548 INFO L225 Difference]: With dead ends: 31 [2024-10-11 22:35:33,548 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 22:35:33,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:35:33,549 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:35:33,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:35:33,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 22:35:33,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 22:35:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 22:35:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-10-11 22:35:33,558 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2024-10-11 22:35:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:35:33,559 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-11 22:35:33,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:35:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-10-11 22:35:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 22:35:33,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:35:33,560 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:35:33,564 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 (5)] Forceful destruction successful, exit code 0 [2024-10-11 22:35:33,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 22:35:33,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:35:33,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:35:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1539744914, now seen corresponding path program 1 times [2024-10-11 22:35:33,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:35:33,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459501831] [2024-10-11 22:35:33,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:35:33,768 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 22:35:33,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:35:33,771 INFO L229 MonitoredProcess]: Starting monitored process 6 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 22:35:33,773 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 (6)] Waiting until timeout for monitored process [2024-10-11 22:35:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:35:33,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:35:33,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:35:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 22:35:33,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:35:33,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:35:33,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459501831] [2024-10-11 22:35:33,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459501831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:35:33,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:35:33,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:35:33,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226462755] [2024-10-11 22:35:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:35:33,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:35:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:35:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:35:33,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:35:33,884 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:35:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:35:33,906 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-10-11 22:35:33,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:35:33,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-11 22:35:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:35:33,907 INFO L225 Difference]: With dead ends: 28 [2024-10-11 22:35:33,907 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:35:33,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 22:35:33,908 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:35:33,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:35:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:35:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:35:33,909 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 22:35:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:35:33,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2024-10-11 22:35:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:35:33,909 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:35:33,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:35:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:35:33,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:35:33,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 22:35:33,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 22:35:33,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 22:35:33,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 22:35:33,921 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 (6)] Ended with exit code 0 [2024-10-11 22:35:34,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 22:35:34,123 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 22:35:34,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:35:34,209 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:35:34,239 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:35:34,243 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodG2BSink.offset [2024-10-11 22:35:34,244 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:35:34,244 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.offset [2024-10-11 22:35:34,244 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:35:34,244 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.base [2024-10-11 22:35:34,245 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:35:34,245 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodG2BSink.offset [2024-10-11 22:35:34,245 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:35:34,245 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.offset [2024-10-11 22:35:34,245 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:35:34,245 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.base [2024-10-11 22:35:34,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:35:34 BoogieIcfgContainer [2024-10-11 22:35:34,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:35:34,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:35:34,250 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:35:34,250 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:35:34,250 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:35:31" (3/4) ... [2024-10-11 22:35:34,252 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:35:34,254 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:35:34,258 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:35:34,258 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~C_INT~TO~VOID [2024-10-11 22:35:34,261 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-11 22:35:34,265 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 22:35:34,265 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 22:35:34,265 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:35:34,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 22:35:34,380 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 22:35:34,380 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:35:34,381 INFO L158 Benchmark]: Toolchain (without parser) took 3697.08ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 42.8MB in the beginning and 90.4MB in the end (delta: -47.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-10-11 22:35:34,381 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 50.3MB. Free memory is still 23.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:35:34,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 818.62ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 42.6MB in the beginning and 64.9MB in the end (delta: -22.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 22:35:34,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.80ms. Allocated memory is still 94.4MB. Free memory was 64.9MB in the beginning and 61.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:35:34,382 INFO L158 Benchmark]: Boogie Preprocessor took 51.41ms. Allocated memory is still 94.4MB. Free memory was 61.7MB in the beginning and 58.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:35:34,382 INFO L158 Benchmark]: RCFGBuilder took 364.91ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 40.3MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 22:35:34,382 INFO L158 Benchmark]: TraceAbstraction took 2266.97ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 39.8MB in the beginning and 94.7MB in the end (delta: -55.0MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-11 22:35:34,383 INFO L158 Benchmark]: Witness Printer took 134.34ms. Allocated memory is still 125.8MB. Free memory was 94.7MB in the beginning and 90.4MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:35:34,384 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.09ms. Allocated memory is still 50.3MB. Free memory is still 23.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 818.62ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 42.6MB in the beginning and 64.9MB in the end (delta: -22.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.80ms. Allocated memory is still 94.4MB. Free memory was 64.9MB in the beginning and 61.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.41ms. Allocated memory is still 94.4MB. Free memory was 61.7MB in the beginning and 58.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 364.91ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 40.3MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2266.97ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 39.8MB in the beginning and 94.7MB in the end (delta: -55.0MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Witness Printer took 134.34ms. Allocated memory is still 125.8MB. Free memory was 94.7MB in the beginning and 90.4MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodG2BSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodG2BSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_rand_preinc_65b_goodB2GSink.base * 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: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: 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 4 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 347 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 139 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=2, InterpolantAutomatonStates: 19, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 2 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 22:35:34,427 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 Writing output log to file Ultimate.log Result: TRUE