./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_add_65_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3021d417ea773182442211d8395df1bb13a1d24ee898cf38c2ccb50278d57df2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 15:10:21,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 15:10:21,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 15:10:21,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 15:10:21,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 15:10:21,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 15:10:21,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 15:10:21,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 15:10:21,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 15:10:21,584 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 15:10:21,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 15:10:21,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 15:10:21,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 15:10:21,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 15:10:21,588 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 15:10:21,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 15:10:21,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 15:10:21,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 15:10:21,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 15:10:21,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 15:10:21,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 15:10:21,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 15:10:21,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 15:10:21,594 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 15:10:21,594 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 15:10:21,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 15:10:21,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 15:10:21,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 15:10:21,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 15:10:21,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 15:10:21,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 15:10:21,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:10:21,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 15:10:21,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 15:10:21,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 15:10:21,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 15:10:21,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 15:10:21,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 15:10:21,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 15:10:21,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 15:10:21,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 15:10:21,600 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3021d417ea773182442211d8395df1bb13a1d24ee898cf38c2ccb50278d57df2 [2024-10-13 15:10:21,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 15:10:21,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 15:10:21,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 15:10:21,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 15:10:21,935 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 15:10:21,936 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-13 15:10:23,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 15:10:23,714 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 15:10:23,715 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-13 15:10:23,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59100c93/acee7a24a8894f7f9ded46dfd8c67288/FLAG1d5afd28e [2024-10-13 15:10:23,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59100c93/acee7a24a8894f7f9ded46dfd8c67288 [2024-10-13 15:10:23,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 15:10:23,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 15:10:23,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 15:10:23,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 15:10:23,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 15:10:23,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:10:23" (1/1) ... [2024-10-13 15:10:23,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fcb7f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:23, skipping insertion in model container [2024-10-13 15:10:23,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:10:23" (1/1) ... [2024-10-13 15:10:23,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 15:10:24,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:10:24,806 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 15:10:24,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:10:24,969 INFO L204 MainTranslator]: Completed translation [2024-10-13 15:10:24,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24 WrapperNode [2024-10-13 15:10:24,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 15:10:24,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 15:10:24,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 15:10:24,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 15:10:24,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,026 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 61 [2024-10-13 15:10:25,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 15:10:25,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 15:10:25,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 15:10:25,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 15:10:25,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,052 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 15:10:25,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 15:10:25,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 15:10:25,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 15:10:25,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 15:10:25,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (1/1) ... [2024-10-13 15:10:25,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:10:25,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:10:25,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 15:10:25,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 15:10:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 15:10:25,158 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 15:10:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 15:10:25,159 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 15:10:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 15:10:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2024-10-13 15:10:25,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2024-10-13 15:10:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 15:10:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 15:10:25,333 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 15:10:25,335 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 15:10:25,473 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-13 15:10:25,477 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 15:10:25,513 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 15:10:25,514 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 15:10:25,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:25 BoogieIcfgContainer [2024-10-13 15:10:25,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 15:10:25,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 15:10:25,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 15:10:25,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 15:10:25,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:10:23" (1/3) ... [2024-10-13 15:10:25,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52258ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:10:25, skipping insertion in model container [2024-10-13 15:10:25,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:24" (2/3) ... [2024-10-13 15:10:25,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52258ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:10:25, skipping insertion in model container [2024-10-13 15:10:25,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:25" (3/3) ... [2024-10-13 15:10:25,528 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_add_65_good.i [2024-10-13 15:10:25,542 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 15:10:25,543 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 15:10:25,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 15:10:25,615 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;@2e685690, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 15:10:25,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 15:10:25,621 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-13 15:10:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 15:10:25,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:25,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:10:25,631 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-13 15:10:25,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1877852356, now seen corresponding path program 1 times [2024-10-13 15:10:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:25,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919681449] [2024-10-13 15:10:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:25,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,028 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-13 15:10:26,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:26,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919681449] [2024-10-13 15:10:26,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919681449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:26,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:26,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 15:10:26,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932622258] [2024-10-13 15:10:26,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:26,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 15:10:26,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:26,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 15:10:26,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:10:26,058 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-13 15:10:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:26,176 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-13 15:10:26,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 15:10:26,181 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-13 15:10:26,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:26,187 INFO L225 Difference]: With dead ends: 56 [2024-10-13 15:10:26,187 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 15:10:26,190 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-13 15:10:26,192 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 15:10:26,193 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-13 15:10:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 15:10:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-10-13 15:10:26,221 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-13 15:10:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-13 15:10:26,223 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 11 [2024-10-13 15:10:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:26,224 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-13 15:10:26,224 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-13 15:10:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-13 15:10:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 15:10:26,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:26,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:10:26,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 15:10:26,226 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-13 15:10:26,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:26,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1916135875, now seen corresponding path program 1 times [2024-10-13 15:10:26,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:26,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049573567] [2024-10-13 15:10:26,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:26,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,383 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-13 15:10:26,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:26,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049573567] [2024-10-13 15:10:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049573567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:26,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:26,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 15:10:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764037909] [2024-10-13 15:10:26,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:26,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 15:10:26,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:26,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 15:10:26,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:10:26,390 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-13 15:10:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:26,479 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-10-13 15:10:26,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 15:10:26,480 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-13 15:10:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:26,481 INFO L225 Difference]: With dead ends: 59 [2024-10-13 15:10:26,481 INFO L226 Difference]: Without dead ends: 37 [2024-10-13 15:10:26,481 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-13 15:10:26,482 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-13 15:10:26,483 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-13 15:10:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-13 15:10:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-13 15:10:26,494 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-13 15:10:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-10-13 15:10:26,495 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 12 [2024-10-13 15:10:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:26,495 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-10-13 15:10:26,496 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-13 15:10:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-10-13 15:10:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 15:10:26,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:26,497 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-13 15:10:26,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 15:10:26,498 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-13 15:10:26,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:26,499 INFO L85 PathProgramCache]: Analyzing trace with hash 158570356, now seen corresponding path program 1 times [2024-10-13 15:10:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:26,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007501273] [2024-10-13 15:10:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:26,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 15:10:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,666 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-13 15:10:26,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:26,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007501273] [2024-10-13 15:10:26,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007501273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:26,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:26,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 15:10:26,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194937194] [2024-10-13 15:10:26,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:26,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 15:10:26,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:26,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 15:10:26,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:10:26,672 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-13 15:10:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:26,747 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-10-13 15:10:26,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 15:10:26,747 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-13 15:10:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:26,749 INFO L225 Difference]: With dead ends: 37 [2024-10-13 15:10:26,749 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 15:10:26,750 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-13 15:10:26,751 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 15:10:26,751 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.1s Time] [2024-10-13 15:10:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 15:10:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-13 15:10:26,757 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-13 15:10:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-10-13 15:10:26,760 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 23 [2024-10-13 15:10:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:26,760 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-10-13 15:10:26,761 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-13 15:10:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-10-13 15:10:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 15:10:26,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:26,762 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-13 15:10:26,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 15:10:26,762 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-13 15:10:26,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash 620713822, now seen corresponding path program 1 times [2024-10-13 15:10:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583716852] [2024-10-13 15:10:26,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 15:10:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:26,935 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-13 15:10:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583716852] [2024-10-13 15:10:26,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583716852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:26,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:26,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 15:10:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778435561] [2024-10-13 15:10:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:26,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:10:26,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:26,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:10:26,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:10:26,939 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-13 15:10:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:26,971 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-10-13 15:10:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:10:26,971 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-13 15:10:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:26,973 INFO L225 Difference]: With dead ends: 38 [2024-10-13 15:10:26,973 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 15:10:26,974 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-13 15:10:26,975 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-13 15:10:26,979 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-13 15:10:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 15:10:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-13 15:10:26,989 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-13 15:10:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-10-13 15:10:26,991 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 24 [2024-10-13 15:10:26,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:26,992 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-10-13 15:10:26,992 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-13 15:10:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-10-13 15:10:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 15:10:26,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:26,994 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-13 15:10:26,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 15:10:26,994 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-13 15:10:26,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash 620696973, now seen corresponding path program 1 times [2024-10-13 15:10:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367781429] [2024-10-13 15:10:26,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:27,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 15:10:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:27,099 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-13 15:10:27,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:27,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367781429] [2024-10-13 15:10:27,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367781429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:27,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:27,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 15:10:27,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947899194] [2024-10-13 15:10:27,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:27,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 15:10:27,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:27,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 15:10:27,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:10:27,103 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-13 15:10:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:27,152 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-10-13 15:10:27,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 15:10:27,153 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-13 15:10:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:27,154 INFO L225 Difference]: With dead ends: 33 [2024-10-13 15:10:27,154 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 15:10:27,154 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-13 15:10:27,155 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-13 15:10:27,156 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-13 15:10:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 15:10:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 15:10:27,157 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-13 15:10:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 15:10:27,157 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-10-13 15:10:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:27,158 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 15:10:27,158 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-13 15:10:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 15:10:27,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 15:10:27,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-13 15:10:27,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-13 15:10:27,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-13 15:10:27,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-13 15:10:27,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 15:10:27,167 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 15:10:27,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 15:10:27,291 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 15:10:27,313 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.base [2024-10-13 15:10:27,314 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-13 15:10:27,315 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.offset [2024-10-13 15:10:27,315 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 15:10:27,316 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.base [2024-10-13 15:10:27,317 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-13 15:10:27,317 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.offset [2024-10-13 15:10:27,318 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 15:10:27,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:10:27 BoogieIcfgContainer [2024-10-13 15:10:27,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 15:10:27,319 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 15:10:27,319 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 15:10:27,320 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 15:10:27,320 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:25" (3/4) ... [2024-10-13 15:10:27,322 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 15:10:27,327 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 15:10:27,327 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 15:10:27,327 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2024-10-13 15:10:27,332 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-13 15:10:27,333 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 15:10:27,333 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 15:10:27,381 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-13 15:10:27,388 INFO L158 Benchmark]: Toolchain (without parser) took 3470.83ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 93.9MB in the beginning and 127.9MB in the end (delta: -34.0MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-10-13 15:10:27,388 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:10:27,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1051.02ms. Allocated memory is still 172.0MB. Free memory was 93.9MB in the beginning and 93.3MB in the end (delta: 618.6kB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-10-13 15:10:27,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.90ms. Allocated memory is still 172.0MB. Free memory was 93.3MB in the beginning and 90.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 15:10:27,389 INFO L158 Benchmark]: Boogie Preprocessor took 39.44ms. Allocated memory is still 172.0MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:10:27,389 INFO L158 Benchmark]: RCFGBuilder took 447.15ms. Allocated memory is still 172.0MB. Free memory was 88.1MB in the beginning and 125.4MB in the end (delta: -37.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 15:10:27,389 INFO L158 Benchmark]: TraceAbstraction took 1798.59ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 125.4MB in the beginning and 131.1MB in the end (delta: -5.7MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-10-13 15:10:27,390 INFO L158 Benchmark]: Witness Printer took 67.89ms. Allocated memory is still 222.3MB. Free memory was 131.1MB in the beginning and 127.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:10:27,392 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.20ms. Allocated memory is still 172.0MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1051.02ms. Allocated memory is still 172.0MB. Free memory was 93.9MB in the beginning and 93.3MB in the end (delta: 618.6kB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.90ms. Allocated memory is still 172.0MB. Free memory was 93.3MB in the beginning and 90.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.44ms. Allocated memory is still 172.0MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 447.15ms. Allocated memory is still 172.0MB. Free memory was 88.1MB in the beginning and 125.4MB in the end (delta: -37.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1798.59ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 125.4MB in the beginning and 131.1MB in the end (delta: -5.7MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 67.89ms. Allocated memory is still 222.3MB. Free memory was 131.1MB in the beginning and 127.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-13 15:10:27,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_add_65_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3021d417ea773182442211d8395df1bb13a1d24ee898cf38c2ccb50278d57df2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 15:10:29,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 15:10:29,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-13 15:10:29,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 15:10:29,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 15:10:29,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-13 15:10:29,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 15:10:29,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 15:10:29,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 15:10:29,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 15:10:29,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 15:10:29,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 15:10:29,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 15:10:29,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 15:10:29,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 15:10:29,795 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 15:10:29,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 15:10:29,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 15:10:29,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 15:10:29,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 15:10:29,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 15:10:29,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 15:10:29,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 15:10:29,802 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 15:10:29,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 15:10:29,802 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 15:10:29,802 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 15:10:29,803 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 15:10:29,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 15:10:29,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 15:10:29,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 15:10:29,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 15:10:29,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 15:10:29,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 15:10:29,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:10:29,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 15:10:29,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 15:10:29,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 15:10:29,819 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 15:10:29,820 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 15:10:29,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 15:10:29,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 15:10:29,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 15:10:29,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 15:10:29,821 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 15:10:29,822 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3021d417ea773182442211d8395df1bb13a1d24ee898cf38c2ccb50278d57df2 [2024-10-13 15:10:30,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 15:10:30,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 15:10:30,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 15:10:30,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 15:10:30,172 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 15:10:30,173 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-13 15:10:31,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 15:10:32,068 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 15:10:32,069 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-13 15:10:32,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1584b2c/3430382562fa4b8285288797007edf80/FLAG35a0f56e2 [2024-10-13 15:10:32,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1584b2c/3430382562fa4b8285288797007edf80 [2024-10-13 15:10:32,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 15:10:32,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 15:10:32,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 15:10:32,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 15:10:32,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 15:10:32,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:10:32" (1/1) ... [2024-10-13 15:10:32,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183b9d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:32, skipping insertion in model container [2024-10-13 15:10:32,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:10:32" (1/1) ... [2024-10-13 15:10:32,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 15:10:32,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:10:32,893 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 15:10:32,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:10:33,131 INFO L204 MainTranslator]: Completed translation [2024-10-13 15:10:33,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33 WrapperNode [2024-10-13 15:10:33,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 15:10:33,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 15:10:33,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 15:10:33,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 15:10:33,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,195 INFO L138 Inliner]: procedures = 507, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 61 [2024-10-13 15:10:33,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 15:10:33,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 15:10:33,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 15:10:33,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 15:10:33,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,236 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 15:10:33,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 15:10:33,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 15:10:33,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 15:10:33,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 15:10:33,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (1/1) ... [2024-10-13 15:10:33,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:10:33,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:10:33,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 15:10:33,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 15:10:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 15:10:33,351 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 15:10:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 15:10:33,351 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 15:10:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 15:10:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_INT~TO~VOID [2024-10-13 15:10:33,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_INT~TO~VOID [2024-10-13 15:10:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 15:10:33,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 15:10:33,500 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 15:10:33,503 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 15:10:33,664 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-13 15:10:33,664 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 15:10:33,724 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 15:10:33,724 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 15:10:33,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:33 BoogieIcfgContainer [2024-10-13 15:10:33,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 15:10:33,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 15:10:33,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 15:10:33,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 15:10:33,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:10:32" (1/3) ... [2024-10-13 15:10:33,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2367f539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:10:33, skipping insertion in model container [2024-10-13 15:10:33,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:33" (2/3) ... [2024-10-13 15:10:33,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2367f539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:10:33, skipping insertion in model container [2024-10-13 15:10:33,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:33" (3/3) ... [2024-10-13 15:10:33,735 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_add_65_good.i [2024-10-13 15:10:33,751 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 15:10:33,751 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 15:10:33,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 15:10:33,819 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;@3e01d77f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 15:10:33,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 15:10:33,823 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-13 15:10:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 15:10:33,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:33,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:10:33,829 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-13 15:10:33,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1877852356, now seen corresponding path program 1 times [2024-10-13 15:10:33,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 15:10:33,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596609173] [2024-10-13 15:10:33,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:33,851 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-13 15:10:33,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 15:10:33,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-13 15:10:33,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 15:10:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:33,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 15:10:33,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:33,997 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-13 15:10:33,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:33,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 15:10:33,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596609173] [2024-10-13 15:10:33,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596609173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:33,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:33,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 15:10:34,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362647048] [2024-10-13 15:10:34,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:34,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 15:10:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 15:10:34,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 15:10:34,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 15:10:34,031 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-13 15:10:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:34,066 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-13 15:10:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 15:10:34,069 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-13 15:10:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:34,076 INFO L225 Difference]: With dead ends: 36 [2024-10-13 15:10:34,077 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 15:10:34,079 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-13 15:10:34,083 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-13 15:10:34,084 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-13 15:10:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 15:10:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-13 15:10:34,118 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-13 15:10:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-13 15:10:34,120 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2024-10-13 15:10:34,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:34,122 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-13 15:10:34,122 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-13 15:10:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-13 15:10:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 15:10:34,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:34,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:10:34,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 15:10:34,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-13 15:10:34,325 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-13 15:10:34,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:34,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1916119026, now seen corresponding path program 1 times [2024-10-13 15:10:34,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 15:10:34,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047573876] [2024-10-13 15:10:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:34,327 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-13 15:10:34,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 15:10:34,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-13 15:10:34,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 15:10:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:34,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 15:10:34,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:34,482 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-13 15:10:34,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:34,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 15:10:34,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047573876] [2024-10-13 15:10:34,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047573876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:34,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:34,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 15:10:34,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000366062] [2024-10-13 15:10:34,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:34,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 15:10:34,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 15:10:34,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 15:10:34,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:10:34,486 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-13 15:10:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:34,571 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-10-13 15:10:34,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 15:10:34,572 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-13 15:10:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:34,573 INFO L225 Difference]: With dead ends: 48 [2024-10-13 15:10:34,573 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 15:10:34,574 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-13 15:10:34,575 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-13 15:10:34,576 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-13 15:10:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 15:10:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-10-13 15:10:34,585 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-13 15:10:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-13 15:10:34,587 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 12 [2024-10-13 15:10:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:34,587 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-13 15:10:34,587 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-13 15:10:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-13 15:10:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 15:10:34,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:34,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:10:34,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-13 15:10:34,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-13 15:10:34,793 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-13 15:10:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:34,795 INFO L85 PathProgramCache]: Analyzing trace with hash 729330087, now seen corresponding path program 1 times [2024-10-13 15:10:34,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 15:10:34,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200549069] [2024-10-13 15:10:34,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:34,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 15:10:34,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 15:10:34,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-13 15:10:34,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 15:10:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:34,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 15:10:34,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:34,883 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-13 15:10:34,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:34,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 15:10:34,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200549069] [2024-10-13 15:10:34,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200549069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:34,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:34,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 15:10:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131947041] [2024-10-13 15:10:34,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:34,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:10:34,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 15:10:34,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:10:34,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:10:34,886 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-13 15:10:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:34,921 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-10-13 15:10:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:10:34,922 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-13 15:10:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:34,923 INFO L225 Difference]: With dead ends: 56 [2024-10-13 15:10:34,923 INFO L226 Difference]: Without dead ends: 29 [2024-10-13 15:10:34,923 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-13 15:10:34,924 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-13 15:10:34,925 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-13 15:10:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-13 15:10:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-13 15:10:34,939 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-13 15:10:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2024-10-13 15:10:34,945 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2024-10-13 15:10:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:34,946 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2024-10-13 15:10:34,946 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-13 15:10:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2024-10-13 15:10:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 15:10:34,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:34,949 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-13 15:10:34,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 15:10:35,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-13 15:10:35,153 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-13 15:10:35,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash 620713822, now seen corresponding path program 1 times [2024-10-13 15:10:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 15:10:35,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035280448] [2024-10-13 15:10:35,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:35,155 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-13 15:10:35,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 15:10:35,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-13 15:10:35,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 15:10:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:35,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 15:10:35,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:35,282 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-13 15:10:35,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:35,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 15:10:35,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035280448] [2024-10-13 15:10:35,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035280448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:35,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:35,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 15:10:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598107010] [2024-10-13 15:10:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:35,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:10:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 15:10:35,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:10:35,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:10:35,286 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-13 15:10:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:35,311 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2024-10-13 15:10:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:10:35,312 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-13 15:10:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:35,312 INFO L225 Difference]: With dead ends: 29 [2024-10-13 15:10:35,312 INFO L226 Difference]: Without dead ends: 26 [2024-10-13 15:10:35,313 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-13 15:10:35,314 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-13 15:10:35,314 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-13 15:10:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-13 15:10:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-13 15:10:35,320 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-13 15:10:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-13 15:10:35,322 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2024-10-13 15:10:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:35,322 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-13 15:10:35,322 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-13 15:10:35,322 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-13 15:10:35,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 15:10:35,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:35,323 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-13 15:10:35,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 15:10:35,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-13 15:10:35,524 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-13 15:10:35,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:35,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2061737047, now seen corresponding path program 1 times [2024-10-13 15:10:35,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 15:10:35,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327828690] [2024-10-13 15:10:35,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:35,525 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-13 15:10:35,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 15:10:35,527 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-13 15:10:35,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 15:10:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:35,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 15:10:35,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:35,660 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-13 15:10:35,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:35,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 15:10:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327828690] [2024-10-13 15:10:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327828690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:35,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 15:10:35,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16582231] [2024-10-13 15:10:35,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:35,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 15:10:35,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 15:10:35,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 15:10:35,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:10:35,668 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-13 15:10:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:35,723 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2024-10-13 15:10:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 15:10:35,723 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-13 15:10:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:35,724 INFO L225 Difference]: With dead ends: 26 [2024-10-13 15:10:35,724 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 15:10:35,725 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-13 15:10:35,725 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-13 15:10:35,726 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-13 15:10:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 15:10:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 15:10:35,727 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-13 15:10:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 15:10:35,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-10-13 15:10:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:35,727 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 15:10:35,728 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-13 15:10:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 15:10:35,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 15:10:35,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-13 15:10:35,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-13 15:10:35,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-13 15:10:35,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-13 15:10:35,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 15:10:35,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-13 15:10:35,937 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 15:10:35,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 15:10:36,074 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 15:10:36,099 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 15:10:36,100 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodG2BSink.offset [2024-10-13 15:10:36,101 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-13 15:10:36,101 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.base [2024-10-13 15:10:36,101 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 15:10:36,104 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.offset [2024-10-13 15:10:36,106 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 15:10:36,106 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodG2BSink.offset [2024-10-13 15:10:36,106 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-13 15:10:36,106 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.base [2024-10-13 15:10:36,107 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 15:10:36,107 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_add_65b_goodB2GSink.offset [2024-10-13 15:10:36,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:10:36 BoogieIcfgContainer [2024-10-13 15:10:36,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 15:10:36,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 15:10:36,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 15:10:36,109 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 15:10:36,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:33" (3/4) ... [2024-10-13 15:10:36,112 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 15:10:36,115 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 15:10:36,115 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 15:10:36,115 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~C_INT~TO~VOID [2024-10-13 15:10:36,119 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-13 15:10:36,120 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 15:10:36,121 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 15:10:36,121 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 15:10:36,157 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-13 15:10:36,160 INFO L158 Benchmark]: Toolchain (without parser) took 4037.97ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 36.8MB in the beginning and 57.4MB in the end (delta: -20.6MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-10-13 15:10:36,160 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 52.4MB. Free memory is still 27.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:10:36,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1007.95ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 36.6MB in the beginning and 58.1MB in the end (delta: -21.5MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-10-13 15:10:36,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.53ms. Allocated memory is still 90.2MB. Free memory was 58.1MB in the beginning and 55.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 15:10:36,161 INFO L158 Benchmark]: Boogie Preprocessor took 69.54ms. Allocated memory is still 90.2MB. Free memory was 54.7MB in the beginning and 52.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:10:36,161 INFO L158 Benchmark]: RCFGBuilder took 454.47ms. Allocated memory is still 90.2MB. Free memory was 52.2MB in the beginning and 58.8MB in the end (delta: -6.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 15:10:36,162 INFO L158 Benchmark]: TraceAbstraction took 2381.42ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 58.0MB in the beginning and 60.8MB in the end (delta: -2.8MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-10-13 15:10:36,162 INFO L158 Benchmark]: Witness Printer took 50.64ms. Allocated memory is still 109.1MB. Free memory was 60.8MB in the beginning and 57.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:10:36,164 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.87ms. Allocated memory is still 52.4MB. Free memory is still 27.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1007.95ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 36.6MB in the beginning and 58.1MB in the end (delta: -21.5MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.53ms. Allocated memory is still 90.2MB. Free memory was 58.1MB in the beginning and 55.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.54ms. Allocated memory is still 90.2MB. Free memory was 54.7MB in the beginning and 52.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.47ms. Allocated memory is still 90.2MB. Free memory was 52.2MB in the beginning and 58.8MB in the end (delta: -6.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2381.42ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 58.0MB in the beginning and 60.8MB in the end (delta: -2.8MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 50.64ms. Allocated memory is still 109.1MB. Free memory was 60.8MB in the beginning and 57.4MB 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.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s 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-13 15:10:36,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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