./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_max_add_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_max_add_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 3021d417ea773182442211d8395df1bb13a1d24ee898cf38c2ccb50278d57df2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:25:38,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:25:38,137 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:25:38,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:25:38,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:25:38,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:25:38,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:25:38,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:25:38,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:25:38,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:25:38,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:25:38,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:25:38,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:25:38,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:25:38,180 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:25:38,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:25:38,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:25:38,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:25:38,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:25:38,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:25:38,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:25:38,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:25:38,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:25:38,189 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:25:38,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:25:38,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:25:38,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:25:38,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:25:38,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:25:38,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:25:38,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:25:38,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:25:38,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:25:38,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:25:38,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:25:38,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:25:38,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:25:38,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:25:38,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:25:38,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:25:38,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:25:38,195 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 -> 3021d417ea773182442211d8395df1bb13a1d24ee898cf38c2ccb50278d57df2 [2024-10-11 22:25:38,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:25:38,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:25:38,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:25:38,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:25:38,464 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:25:38,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_add_65_good.i [2024-10-11 22:25:39,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:25:40,347 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:25:40,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_add_65_good.i [2024-10-11 22:25:40,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f6fe9658e/a323444274de475ba748fbf511bd36de/FLAG5d4129acc [2024-10-11 22:25:40,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f6fe9658e/a323444274de475ba748fbf511bd36de [2024-10-11 22:25:40,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:25:40,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:25:40,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:25:40,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:25:40,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:25:40,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:25:40" (1/1) ... [2024-10-11 22:25:40,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71212874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:40, skipping insertion in model container [2024-10-11 22:25:40,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:25:40" (1/1) ... [2024-10-11 22:25:40,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:25:41,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:25:41,419 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:25:41,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:25:41,660 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:25:41,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41 WrapperNode [2024-10-11 22:25:41,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:25:41,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:25:41,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:25:41,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:25:41,669 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:25:41" (1/1) ... [2024-10-11 22:25:41,703 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:25:41" (1/1) ... [2024-10-11 22:25:41,736 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 61 [2024-10-11 22:25:41,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:25:41,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:25:41,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:25:41,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:25:41,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (1/1) ... [2024-10-11 22:25:41,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (1/1) ... [2024-10-11 22:25:41,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (1/1) ... [2024-10-11 22:25:41,774 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:25:41,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (1/1) ... [2024-10-11 22:25:41,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (1/1) ... [2024-10-11 22:25:41,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (1/1) ... [2024-10-11 22:25:41,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (1/1) ... [2024-10-11 22:25:41,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (1/1) ... [2024-10-11 22:25:41,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (1/1) ... [2024-10-11 22:25:41,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:25:41,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:25:41,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:25:41,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:25:41,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (1/1) ... [2024-10-11 22:25:41,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:25:41,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:25:41,841 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:25:41,847 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:25:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:25:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:25:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:25:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:25:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:25:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2024-10-11 22:25:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2024-10-11 22:25:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:25:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:25:42,009 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:25:42,011 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:25:42,198 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 22:25:42,198 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:25:42,253 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:25:42,253 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:25:42,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:42 BoogieIcfgContainer [2024-10-11 22:25:42,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:25:42,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:25:42,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:25:42,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:25:42,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:25:40" (1/3) ... [2024-10-11 22:25:42,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd2f6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:25:42, skipping insertion in model container [2024-10-11 22:25:42,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:41" (2/3) ... [2024-10-11 22:25:42,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd2f6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:25:42, skipping insertion in model container [2024-10-11 22:25:42,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:42" (3/3) ... [2024-10-11 22:25:42,269 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_add_65_good.i [2024-10-11 22:25:42,282 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:25:42,282 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 22:25:42,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:25:42,344 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;@2b22be4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:25:42,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 22:25:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 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:25:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:25:42,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:25:42,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:25:42,358 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:25:42,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:25:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1877852356, now seen corresponding path program 1 times [2024-10-11 22:25:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:25:42,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378075821] [2024-10-11 22:25:42,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:25:42,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:25:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:25:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:42,807 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:25:42,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:25:42,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378075821] [2024-10-11 22:25:42,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378075821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:25:42,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:25:42,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:25:42,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633634473] [2024-10-11 22:25:42,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:25:42,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:25:42,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:25:42,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:25:42,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:25:42,836 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 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:25:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:25:42,955 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-11 22:25:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:25:42,957 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:25:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:25:42,962 INFO L225 Difference]: With dead ends: 56 [2024-10-11 22:25:42,962 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 22:25:42,965 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:25:42,968 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 165 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:25:42,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 165 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:25:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 22:25:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-10-11 22:25:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.3076923076923077) 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:25:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-11 22:25:43,007 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 11 [2024-10-11 22:25:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:25:43,009 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-11 22:25:43,009 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:25:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-11 22:25:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:25:43,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:25:43,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:25:43,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:25:43,011 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:25:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:25:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1916135875, now seen corresponding path program 1 times [2024-10-11 22:25:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:25:43,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822829891] [2024-10-11 22:25:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:25:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:25:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:25:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,157 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:25:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:25:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822829891] [2024-10-11 22:25:43,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822829891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:25:43,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:25:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:25:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432379734] [2024-10-11 22:25:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:25:43,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:25:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:25:43,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:25:43,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:25:43,165 INFO L87 Difference]: Start difference. First operand 39 states and 45 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:25:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:25:43,258 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-10-11 22:25:43,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:25:43,259 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:25:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:25:43,261 INFO L225 Difference]: With dead ends: 59 [2024-10-11 22:25:43,261 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 22:25:43,261 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:25:43,262 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 106 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:25:43,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 106 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:25:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 22:25:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 22:25:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 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:25:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-10-11 22:25:43,274 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 12 [2024-10-11 22:25:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:25:43,274 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-10-11 22:25:43,274 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:25:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-10-11 22:25:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 22:25:43,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:25:43,275 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] [2024-10-11 22:25:43,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:25:43,276 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:25:43,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:25:43,277 INFO L85 PathProgramCache]: Analyzing trace with hash 158570356, now seen corresponding path program 1 times [2024-10-11 22:25:43,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:25:43,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420675019] [2024-10-11 22:25:43,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:25:43,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:25:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:25:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:25:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 22:25:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,419 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:25:43,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:25:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420675019] [2024-10-11 22:25:43,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420675019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:25:43,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:25:43,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:25:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546439722] [2024-10-11 22:25:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:25:43,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:25:43,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:25:43,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:25:43,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:25:43,426 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:25:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:25:43,486 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-10-11 22:25:43,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:25:43,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 23 [2024-10-11 22:25:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:25:43,488 INFO L225 Difference]: With dead ends: 37 [2024-10-11 22:25:43,488 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 22:25:43,488 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:25:43,489 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:25:43,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:25:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 22:25:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 22:25:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 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:25:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-10-11 22:25:43,495 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 23 [2024-10-11 22:25:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:25:43,495 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-10-11 22:25:43,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:25:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-10-11 22:25:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 22:25:43,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:25:43,497 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] [2024-10-11 22:25:43,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:25:43,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr3ASSERT_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:25:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:25:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash 620713822, now seen corresponding path program 1 times [2024-10-11 22:25:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:25:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170570133] [2024-10-11 22:25:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:25:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:25:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:25:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:25:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 22:25:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,643 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:25:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:25:43,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170570133] [2024-10-11 22:25:43,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170570133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:25:43,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:25:43,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:25:43,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028996616] [2024-10-11 22:25:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:25:43,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:25:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:25:43,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:25:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:25:43,647 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:25:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:25:43,676 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-10-11 22:25:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:25:43,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 24 [2024-10-11 22:25:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:25:43,679 INFO L225 Difference]: With dead ends: 38 [2024-10-11 22:25:43,681 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 22:25:43,682 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:25:43,683 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 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:25:43,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:25:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 22:25:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-11 22:25:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 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:25:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-10-11 22:25:43,697 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 24 [2024-10-11 22:25:43,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:25:43,698 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-10-11 22:25:43,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:25:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-10-11 22:25:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 22:25:43,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:25:43,699 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] [2024-10-11 22:25:43,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:25:43,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:25:43,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:25:43,702 INFO L85 PathProgramCache]: Analyzing trace with hash 620696973, now seen corresponding path program 1 times [2024-10-11 22:25:43,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:25:43,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750798390] [2024-10-11 22:25:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:25:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:25:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:25:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:25:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 22:25:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:43,815 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:25:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:25:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750798390] [2024-10-11 22:25:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750798390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:25:43,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:25:43,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:25:43,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473099175] [2024-10-11 22:25:43,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:25:43,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:25:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:25:43,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:25:43,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:25:43,818 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:25:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:25:43,871 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-10-11 22:25:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:25:43,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 24 [2024-10-11 22:25:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:25:43,872 INFO L225 Difference]: With dead ends: 33 [2024-10-11 22:25:43,872 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:25:43,873 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:25:43,874 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:25:43,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:25:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:25:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:25:43,879 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:25:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:25:43,880 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-10-11 22:25:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:25:43,880 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:25:43,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:25:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:25:43,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:25:43,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 22:25:43,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 22:25:43,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 22:25:43,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 22:25:43,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:25:43,890 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 22:25:43,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:25:44,023 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:25:44,049 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.base [2024-10-11 22:25:44,050 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:25:44,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.offset [2024-10-11 22:25:44,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:25:44,053 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.base [2024-10-11 22:25:44,054 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:25:44,054 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.offset [2024-10-11 22:25:44,054 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:25:44,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:25:44 BoogieIcfgContainer [2024-10-11 22:25:44,059 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:25:44,060 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:25:44,060 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:25:44,060 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:25:44,061 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:42" (3/4) ... [2024-10-11 22:25:44,063 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:25:44,067 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:25:44,067 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:25:44,068 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2024-10-11 22:25:44,073 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-11 22:25:44,074 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 22:25:44,074 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 22:25:44,118 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:25:44,121 INFO L158 Benchmark]: Toolchain (without parser) took 3556.12ms. Allocated memory is still 163.6MB. Free memory was 126.0MB in the beginning and 81.9MB in the end (delta: 44.1MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2024-10-11 22:25:44,121 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:25:44,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1095.10ms. Allocated memory is still 163.6MB. Free memory was 125.0MB in the beginning and 60.0MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-11 22:25:44,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.59ms. Allocated memory is still 163.6MB. Free memory was 60.0MB in the beginning and 56.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:25:44,122 INFO L158 Benchmark]: Boogie Preprocessor took 59.13ms. Allocated memory is still 163.6MB. Free memory was 56.8MB in the beginning and 54.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:25:44,122 INFO L158 Benchmark]: RCFGBuilder took 455.76ms. Allocated memory is still 163.6MB. Free memory was 54.7MB in the beginning and 127.9MB in the end (delta: -73.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 22:25:44,122 INFO L158 Benchmark]: TraceAbstraction took 1803.51ms. Allocated memory is still 163.6MB. Free memory was 127.9MB in the beginning and 85.1MB in the end (delta: 42.9MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2024-10-11 22:25:44,123 INFO L158 Benchmark]: Witness Printer took 60.48ms. Allocated memory is still 163.6MB. Free memory was 85.1MB in the beginning and 81.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:25:44,124 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.13ms. Allocated memory is still 113.2MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1095.10ms. Allocated memory is still 163.6MB. Free memory was 125.0MB in the beginning and 60.0MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.59ms. Allocated memory is still 163.6MB. Free memory was 60.0MB in the beginning and 56.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.13ms. Allocated memory is still 163.6MB. Free memory was 56.8MB in the beginning and 54.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 455.76ms. Allocated memory is still 163.6MB. Free memory was 54.7MB in the beginning and 127.9MB in the end (delta: -73.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1803.51ms. Allocated memory is still 163.6MB. Free memory was 127.9MB in the beginning and 85.1MB in the end (delta: 42.9MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * Witness Printer took 60.48ms. Allocated memory is still 163.6MB. Free memory was 85.1MB in the beginning and 81.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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_max_add_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_max_add_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_max_add_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_max_add_65b_goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset * 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: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: 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, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 594 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 195 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 143 mSDtfsCounter, 195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=1, InterpolantAutomatonStates: 28, 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.7s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 9/9 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: ((2 == \old()) || (2147483647 <= \old())) Ensures: ((2 == \old()) || (2147483647 <= \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:25:44,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_add_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 3021d417ea773182442211d8395df1bb13a1d24ee898cf38c2ccb50278d57df2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:25:46,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:25:46,526 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:25:46,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:25:46,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:25:46,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-11 22:25:46,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:25:46,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:25:46,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:25:46,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:25:46,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:25:46,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:25:46,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:25:46,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:25:46,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:25:46,573 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:25:46,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:25:46,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:25:46,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:25:46,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:25:46,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:25:46,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:25:46,576 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 22:25:46,576 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 22:25:46,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:25:46,577 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:25:46,577 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 22:25:46,578 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:25:46,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:25:46,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:25:46,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:25:46,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:25:46,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:25:46,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:25:46,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:25:46,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:25:46,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:25:46,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:25:46,581 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 22:25:46,582 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 22:25:46,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:25:46,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:25:46,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:25:46,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:25:46,586 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 22:25:46,586 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 -> 3021d417ea773182442211d8395df1bb13a1d24ee898cf38c2ccb50278d57df2 [2024-10-11 22:25:46,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:25:46,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:25:46,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:25:46,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:25:46,946 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:25:46,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_add_65_good.i [2024-10-11 22:25:48,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:25:48,846 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:25:48,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_add_65_good.i [2024-10-11 22:25:48,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8d51e148f/743a36c739164833b54b8373923dd110/FLAGdd2ed79f9 [2024-10-11 22:25:48,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8d51e148f/743a36c739164833b54b8373923dd110 [2024-10-11 22:25:48,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:25:48,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:25:48,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:25:48,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:25:48,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:25:48,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:25:48" (1/1) ... [2024-10-11 22:25:48,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b134e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:48, skipping insertion in model container [2024-10-11 22:25:48,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:25:48" (1/1) ... [2024-10-11 22:25:48,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:25:50,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:25:50,063 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:25:50,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:25:50,308 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:25:50,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50 WrapperNode [2024-10-11 22:25:50,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:25:50,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:25:50,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:25:50,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:25:50,316 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:25:50" (1/1) ... [2024-10-11 22:25:50,346 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:25:50" (1/1) ... [2024-10-11 22:25:50,369 INFO L138 Inliner]: procedures = 507, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 61 [2024-10-11 22:25:50,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:25:50,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:25:50,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:25:50,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:25:50,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (1/1) ... [2024-10-11 22:25:50,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (1/1) ... [2024-10-11 22:25:50,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (1/1) ... [2024-10-11 22:25:50,400 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:25:50,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (1/1) ... [2024-10-11 22:25:50,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (1/1) ... [2024-10-11 22:25:50,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (1/1) ... [2024-10-11 22:25:50,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (1/1) ... [2024-10-11 22:25:50,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (1/1) ... [2024-10-11 22:25:50,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (1/1) ... [2024-10-11 22:25:50,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:25:50,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:25:50,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:25:50,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:25:50,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (1/1) ... [2024-10-11 22:25:50,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:25:50,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:25:50,470 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:25:50,472 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:25:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:25:50,510 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:25:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:25:50,510 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:25:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:25:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_INT~TO~VOID [2024-10-11 22:25:50,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_INT~TO~VOID [2024-10-11 22:25:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:25:50,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:25:50,668 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:25:50,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:25:50,844 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-11 22:25:50,845 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:25:50,885 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:25:50,886 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:25:50,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:50 BoogieIcfgContainer [2024-10-11 22:25:50,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:25:50,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:25:50,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:25:50,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:25:50,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:25:48" (1/3) ... [2024-10-11 22:25:50,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509bbc12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:25:50, skipping insertion in model container [2024-10-11 22:25:50,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:50" (2/3) ... [2024-10-11 22:25:50,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509bbc12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:25:50, skipping insertion in model container [2024-10-11 22:25:50,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:50" (3/3) ... [2024-10-11 22:25:50,897 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_add_65_good.i [2024-10-11 22:25:50,914 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:25:50,914 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 22:25:50,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:25:50,986 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;@7280d395, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:25:50,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 22:25:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 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:25:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:25:50,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:25:50,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:25:50,997 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:25:51,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:25:51,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1877852356, now seen corresponding path program 1 times [2024-10-11 22:25:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:25:51,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2271398] [2024-10-11 22:25:51,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:25:51,036 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:25:51,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:25:51,039 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:25:51,040 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:25:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:51,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 22:25:51,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:25:51,165 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:25:51,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:25:51,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:25:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2271398] [2024-10-11 22:25:51,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2271398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:25:51,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:25:51,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 22:25:51,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052199838] [2024-10-11 22:25:51,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:25:51,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 22:25:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:25:51,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 22:25:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:25:51,205 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 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:25:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:25:51,240 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-11 22:25:51,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 22:25:51,243 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:25:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:25:51,250 INFO L225 Difference]: With dead ends: 36 [2024-10-11 22:25:51,251 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 22:25:51,254 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:25:51,259 INFO L432 NwaCegarLoop]: 35 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, 35 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:25:51,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:25:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 22:25:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 22:25:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 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:25:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-11 22:25:51,298 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2024-10-11 22:25:51,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:25:51,300 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-11 22:25:51,300 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:25:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-11 22:25:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:25:51,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:25:51,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:25:51,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 22:25:51,501 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:25:51,503 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:25:51,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:25:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1916119026, now seen corresponding path program 1 times [2024-10-11 22:25:51,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:25:51,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360206946] [2024-10-11 22:25:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:25:51,505 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:25:51,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:25:51,507 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:25:51,528 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:25:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:51,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 22:25:51,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:25:51,693 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:25:51,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:25:51,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:25:51,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360206946] [2024-10-11 22:25:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360206946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:25:51,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:25:51,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:25:51,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454598358] [2024-10-11 22:25:51,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:25:51,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:25:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:25:51,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:25:51,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:25:51,699 INFO L87 Difference]: Start difference. First operand 30 states and 35 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:25:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:25:51,803 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-10-11 22:25:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:25:51,804 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:25:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:25:51,805 INFO L225 Difference]: With dead ends: 48 [2024-10-11 22:25:51,805 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 22:25:51,806 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:25:51,807 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 129 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:25:51,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 129 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:25:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 22:25:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-10-11 22:25:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 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:25:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-11 22:25:51,820 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 12 [2024-10-11 22:25:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:25:51,821 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-11 22:25:51,821 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:25:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-11 22:25:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 22:25:51,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:25:51,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:25:51,829 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:25:52,024 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:25:52,025 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:25:52,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:25:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash 729330087, now seen corresponding path program 1 times [2024-10-11 22:25:52,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:25:52,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795964390] [2024-10-11 22:25:52,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:25:52,031 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:25:52,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:25:52,034 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:25:52,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:25:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:52,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 22:25:52,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:25:52,133 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:25:52,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:25:52,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:25:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795964390] [2024-10-11 22:25:52,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795964390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:25:52,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:25:52,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:25:52,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001827489] [2024-10-11 22:25:52,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:25:52,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:25:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:25:52,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:25:52,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:25:52,138 INFO L87 Difference]: Start difference. First operand 37 states and 42 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:25:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:25:52,195 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-10-11 22:25:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:25:52,196 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:25:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:25:52,196 INFO L225 Difference]: With dead ends: 56 [2024-10-11 22:25:52,197 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 22:25:52,197 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:25:52,198 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 51 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:25:52,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 51 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:25:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 22:25:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 22:25:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 21 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:25:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2024-10-11 22:25:52,210 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2024-10-11 22:25:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:25:52,211 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2024-10-11 22:25:52,212 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:25:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2024-10-11 22:25:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 22:25:52,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:25:52,214 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] [2024-10-11 22:25:52,221 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:25:52,419 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:25:52,420 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:25:52,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:25:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash 620713822, now seen corresponding path program 1 times [2024-10-11 22:25:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:25:52,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37486660] [2024-10-11 22:25:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:25:52,421 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:25:52,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:25:52,425 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:25:52,428 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:25:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:52,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 22:25:52,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:25:52,544 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:25:52,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:25:52,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:25:52,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37486660] [2024-10-11 22:25:52,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37486660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:25:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:25:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:25:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108696166] [2024-10-11 22:25:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:25:52,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:25:52,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:25:52,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:25:52,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:25:52,551 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:25:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:25:52,583 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2024-10-11 22:25:52,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:25:52,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 24 [2024-10-11 22:25:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:25:52,585 INFO L225 Difference]: With dead ends: 29 [2024-10-11 22:25:52,585 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 22:25:52,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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:25:52,588 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 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:25:52,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:25:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 22:25:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 22:25:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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:25:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-11 22:25:52,599 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2024-10-11 22:25:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:25:52,599 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-11 22:25:52,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:25:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-11 22:25:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 22:25:52,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:25:52,602 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] [2024-10-11 22:25:52,609 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:25:52,803 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:25:52,803 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:25:52,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:25:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2061737047, now seen corresponding path program 1 times [2024-10-11 22:25:52,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:25:52,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708409402] [2024-10-11 22:25:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:25:52,805 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:25:52,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:25:52,808 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:25:52,809 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:25:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:25:52,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 22:25:52,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:25:52,943 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:25:52,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:25:52,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:25:52,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708409402] [2024-10-11 22:25:52,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708409402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:25:52,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:25:52,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 22:25:52,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901267508] [2024-10-11 22:25:52,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:25:52,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:25:52,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:25:52,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:25:52,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:25:52,950 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:25:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:25:53,008 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2024-10-11 22:25:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:25:53,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 25 [2024-10-11 22:25:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:25:53,009 INFO L225 Difference]: With dead ends: 26 [2024-10-11 22:25:53,009 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:25:53,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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:25:53,011 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:25:53,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:25:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:25:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:25:53,016 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:25:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:25:53,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-10-11 22:25:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:25:53,016 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:25:53,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:25:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:25:53,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:25:53,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 22:25:53,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 22:25:53,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 22:25:53,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 22:25:53,025 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:25:53,221 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:25:53,224 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 22:25:53,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:25:53,388 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:25:53,421 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:25:53,422 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodG2BSink.offset [2024-10-11 22:25:53,423 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:25:53,435 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.base [2024-10-11 22:25:53,435 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:25:53,435 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.offset [2024-10-11 22:25:53,436 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:25:53,436 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodG2BSink.offset [2024-10-11 22:25:53,436 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:25:53,436 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.base [2024-10-11 22:25:53,437 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:25:53,437 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.offset [2024-10-11 22:25:53,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:25:53 BoogieIcfgContainer [2024-10-11 22:25:53,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:25:53,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:25:53,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:25:53,439 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:25:53,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:50" (3/4) ... [2024-10-11 22:25:53,441 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:25:53,444 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:25:53,445 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:25:53,445 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~C_INT~TO~VOID [2024-10-11 22:25:53,449 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-11 22:25:53,450 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 22:25:53,451 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 22:25:53,451 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:25:53,492 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:25:53,495 INFO L158 Benchmark]: Toolchain (without parser) took 4597.80ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 49.3MB in the beginning and 64.6MB in the end (delta: -15.3MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-10-11 22:25:53,495 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 52.4MB. Free memory was 27.7MB in the beginning and 27.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:25:53,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1410.51ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 49.1MB in the beginning and 69.5MB in the end (delta: -20.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 22:25:53,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.33ms. Allocated memory is still 98.6MB. Free memory was 69.5MB in the beginning and 66.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:25:53,495 INFO L158 Benchmark]: Boogie Preprocessor took 61.39ms. Allocated memory is still 98.6MB. Free memory was 66.4MB in the beginning and 63.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:25:53,496 INFO L158 Benchmark]: RCFGBuilder took 454.28ms. Allocated memory is still 98.6MB. Free memory was 63.7MB in the beginning and 46.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 22:25:53,496 INFO L158 Benchmark]: TraceAbstraction took 2548.62ms. Allocated memory is still 98.6MB. Free memory was 45.4MB in the beginning and 68.0MB in the end (delta: -22.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-10-11 22:25:53,496 INFO L158 Benchmark]: Witness Printer took 56.08ms. Allocated memory is still 98.6MB. Free memory was 68.0MB in the beginning and 64.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:25:53,498 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.26ms. Allocated memory is still 52.4MB. Free memory was 27.7MB in the beginning and 27.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1410.51ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 49.1MB in the beginning and 69.5MB in the end (delta: -20.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.33ms. Allocated memory is still 98.6MB. Free memory was 69.5MB in the beginning and 66.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.39ms. Allocated memory is still 98.6MB. Free memory was 66.4MB in the beginning and 63.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.28ms. Allocated memory is still 98.6MB. Free memory was 63.7MB in the beginning and 46.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2548.62ms. Allocated memory is still 98.6MB. Free memory was 45.4MB in the beginning and 68.0MB in the end (delta: -22.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Witness Printer took 56.08ms. Allocated memory is still 98.6MB. Free memory was 68.0MB in the beginning and 64.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. 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_max_add_65b_goodG2BSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_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_max_add_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_max_add_65b_goodG2BSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_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_max_add_65b_goodB2GSink.offset * 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: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: 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, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 354 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 232 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 122 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=2, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 122 SizeOfPredicates, 3 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 21 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 - ProcedureContractResult [Line: -1]: Procedure Contract for ##fun~C_INT~TO~VOID Derived contract for procedure ##fun~C_INT~TO~VOID. Requires: ((2 == \old()) || (2147483647 == \old())) Ensures: ((2 == \old()) || (2147483647 == \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:25:53,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null