./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_preinc_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_65_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d2471229a970f2e81daebfd2aacac11bb45cd3b2712bd2a124cea60d0cd4cc3f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:28:54,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:28:54,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:28:54,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:28:54,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:28:54,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:28:54,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:28:54,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:28:54,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:28:54,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:28:54,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:28:54,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:28:54,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:28:54,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:28:54,402 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:28:54,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:28:54,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:28:54,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:28:54,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:28:54,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:28:54,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:28:54,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:28:54,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:28:54,408 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:28:54,408 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:28:54,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:28:54,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:28:54,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:28:54,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:28:54,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:28:54,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:28:54,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:28:54,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:28:54,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:28:54,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:28:54,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:28:54,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:28:54,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:28:54,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:28:54,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:28:54,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:28:54,413 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2471229a970f2e81daebfd2aacac11bb45cd3b2712bd2a124cea60d0cd4cc3f [2024-10-11 22:28:54,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:28:54,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:28:54,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:28:54,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:28:54,699 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:28:54,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_65_good.i [2024-10-11 22:28:56,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:28:56,579 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:28:56,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_65_good.i [2024-10-11 22:28:56,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/601f11f44/21b43fe4daf441638ac764017246ba5f/FLAG5623ef626 [2024-10-11 22:28:56,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/601f11f44/21b43fe4daf441638ac764017246ba5f [2024-10-11 22:28:56,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:28:56,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:28:56,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:28:56,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:28:56,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:28:56,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:28:56" (1/1) ... [2024-10-11 22:28:56,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38be4de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:56, skipping insertion in model container [2024-10-11 22:28:56,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:28:56" (1/1) ... [2024-10-11 22:28:56,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:28:57,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:28:57,487 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:28:57,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:28:57,752 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:28:57,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57 WrapperNode [2024-10-11 22:28:57,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:28:57,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:28:57,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:28:57,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:28:57,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,815 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 67 [2024-10-11 22:28:57,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:28:57,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:28:57,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:28:57,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:28:57,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,839 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:28:57,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:28:57,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:28:57,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:28:57,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:28:57,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (1/1) ... [2024-10-11 22:28:57,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:28:57,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:28:57,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:28:57,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:28:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:28:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:28:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:28:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:28:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:28:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2024-10-11 22:28:57,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2024-10-11 22:28:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:28:57,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:28:58,117 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:28:58,120 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:28:58,248 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 22:28:58,248 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:28:58,280 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:28:58,281 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:28:58,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:28:58 BoogieIcfgContainer [2024-10-11 22:28:58,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:28:58,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:28:58,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:28:58,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:28:58,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:28:56" (1/3) ... [2024-10-11 22:28:58,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d0bef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:28:58, skipping insertion in model container [2024-10-11 22:28:58,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:57" (2/3) ... [2024-10-11 22:28:58,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d0bef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:28:58, skipping insertion in model container [2024-10-11 22:28:58,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:28:58" (3/3) ... [2024-10-11 22:28:58,290 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_preinc_65_good.i [2024-10-11 22:28:58,303 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:28:58,303 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 22:28:58,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:28:58,365 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;@285c7235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:28:58,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 22:28:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 22:28:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:28:58,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:28:58,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:28:58,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:28:58,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:28:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1877852356, now seen corresponding path program 1 times [2024-10-11 22:28:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:28:58,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806354941] [2024-10-11 22:28:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:28:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:28:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:28:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:28:58,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:28:58,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806354941] [2024-10-11 22:28:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806354941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:28:58,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:28:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:28:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104732991] [2024-10-11 22:28:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:28:58,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:28:58,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:28:58,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:28:58,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:28:58,835 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:28:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:28:58,962 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-11 22:28:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:28:58,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 22:28:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:28:58,976 INFO L225 Difference]: With dead ends: 56 [2024-10-11 22:28:58,977 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 22:28:58,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 22:28:58,983 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:28:58,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 165 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:28:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 22:28:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-10-11 22:28:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:28:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-11 22:28:59,017 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 11 [2024-10-11 22:28:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:28:59,018 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-11 22:28:59,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:28:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-11 22:28:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:28:59,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:28:59,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:28:59,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:28:59,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:28:59,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:28:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1916135875, now seen corresponding path program 1 times [2024-10-11 22:28:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:28:59,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479916766] [2024-10-11 22:28:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:28:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:28:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:28:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:28:59,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:28:59,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479916766] [2024-10-11 22:28:59,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479916766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:28:59,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:28:59,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:28:59,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101664606] [2024-10-11 22:28:59,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:28:59,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:28:59,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:28:59,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:28:59,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:28:59,185 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:28:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:28:59,265 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-10-11 22:28:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:28:59,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 22:28:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:28:59,266 INFO L225 Difference]: With dead ends: 59 [2024-10-11 22:28:59,267 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 22:28:59,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 22:28:59,268 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:28:59,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 106 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:28:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 22:28:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 22:28:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 22:28:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-10-11 22:28:59,281 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 12 [2024-10-11 22:28:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:28:59,281 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-10-11 22:28:59,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:28:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-10-11 22:28:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 22:28:59,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:28:59,283 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:28:59,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:28:59,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:28:59,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:28:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash 158570356, now seen corresponding path program 1 times [2024-10-11 22:28:59,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:28:59,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941811058] [2024-10-11 22:28:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:28:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:28:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:28:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:28:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 22:28:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:28:59,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:28:59,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941811058] [2024-10-11 22:28:59,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941811058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:28:59,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:28:59,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:28:59,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632770462] [2024-10-11 22:28:59,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:28:59,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:28:59,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:28:59,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:28:59,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:28:59,437 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:28:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:28:59,509 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-10-11 22:28:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:28:59,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-11 22:28:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:28:59,511 INFO L225 Difference]: With dead ends: 37 [2024-10-11 22:28:59,513 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 22:28:59,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 22:28:59,515 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:28:59,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:28:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 22:28:59,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 22:28:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 22:28:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-10-11 22:28:59,524 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 23 [2024-10-11 22:28:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:28:59,525 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-10-11 22:28:59,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:28:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-10-11 22:28:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 22:28:59,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:28:59,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:28:59,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:28:59,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:28:59,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:28:59,528 INFO L85 PathProgramCache]: Analyzing trace with hash 620713822, now seen corresponding path program 1 times [2024-10-11 22:28:59,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:28:59,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175857447] [2024-10-11 22:28:59,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:28:59,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:28:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:28:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:28:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 22:28:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:28:59,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:28:59,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175857447] [2024-10-11 22:28:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175857447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:28:59,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:28:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:28:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864288190] [2024-10-11 22:28:59,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:28:59,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:28:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:28:59,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:28:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:28:59,674 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:28:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:28:59,705 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-10-11 22:28:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:28:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-10-11 22:28:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:28:59,708 INFO L225 Difference]: With dead ends: 38 [2024-10-11 22:28:59,709 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 22:28:59,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:28:59,711 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:28:59,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:28:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 22:28:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-11 22:28:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 22:28:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-10-11 22:28:59,722 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 24 [2024-10-11 22:28:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:28:59,722 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-10-11 22:28:59,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:28:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-10-11 22:28:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 22:28:59,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:28:59,725 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:28:59,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:28:59,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:28:59,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:28:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash 620696973, now seen corresponding path program 1 times [2024-10-11 22:28:59,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:28:59,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543677184] [2024-10-11 22:28:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:28:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:28:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:28:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:28:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 22:28:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:28:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:28:59,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:28:59,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543677184] [2024-10-11 22:28:59,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543677184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:28:59,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:28:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:28:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441323880] [2024-10-11 22:28:59,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:28:59,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:28:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:28:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:28:59,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:28:59,829 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:28:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:28:59,880 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-10-11 22:28:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:28:59,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-10-11 22:28:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:28:59,881 INFO L225 Difference]: With dead ends: 33 [2024-10-11 22:28:59,881 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:28:59,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 22:28:59,882 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:28:59,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:28:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:28:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:28:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 22:28:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:28:59,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-10-11 22:28:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:28:59,888 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:28:59,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:28:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:28:59,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:28:59,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 22:28:59,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 22:28:59,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 22:28:59,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 22:28:59,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:28:59,896 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 22:28:59,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:29:00,026 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:29:00,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.base [2024-10-11 22:29:00,056 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:29:00,057 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.offset [2024-10-11 22:29:00,057 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:29:00,058 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.base [2024-10-11 22:29:00,058 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:29:00,060 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.offset [2024-10-11 22:29:00,060 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:29:00,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:29:00 BoogieIcfgContainer [2024-10-11 22:29:00,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:29:00,061 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:29:00,063 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:29:00,063 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:29:00,063 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:28:58" (3/4) ... [2024-10-11 22:29:00,065 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:29:00,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:29:00,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:29:00,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2024-10-11 22:29:00,075 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-11 22:29:00,076 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 22:29:00,076 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 22:29:00,122 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitnessLocation(YamlCorrectnessWitnessGenerator.java:111) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.extractFunctionContracts(YamlCorrectnessWitnessGenerator.java:104) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitness(YamlCorrectnessWitnessGenerator.java:66) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.makeYamlString(YamlCorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:170) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:140) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:130) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-11 22:29:00,128 INFO L158 Benchmark]: Toolchain (without parser) took 3491.63ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 141.5MB in the beginning and 86.2MB in the end (delta: 55.3MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2024-10-11 22:29:00,128 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 130.0MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:29:00,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1115.02ms. Allocated memory is still 174.1MB. Free memory was 141.5MB in the beginning and 126.6MB in the end (delta: 14.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-10-11 22:29:00,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.39ms. Allocated memory is still 174.1MB. Free memory was 126.6MB in the beginning and 124.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:29:00,129 INFO L158 Benchmark]: Boogie Preprocessor took 45.73ms. Allocated memory is still 174.1MB. Free memory was 124.5MB in the beginning and 122.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:29:00,129 INFO L158 Benchmark]: RCFGBuilder took 419.00ms. Allocated memory is still 174.1MB. Free memory was 121.4MB in the beginning and 106.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 22:29:00,129 INFO L158 Benchmark]: TraceAbstraction took 1777.22ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 105.7MB in the beginning and 89.3MB in the end (delta: 16.4MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2024-10-11 22:29:00,129 INFO L158 Benchmark]: Witness Printer took 65.74ms. Allocated memory is still 209.7MB. Free memory was 89.3MB in the beginning and 86.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:29:00,131 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.11ms. Allocated memory is still 130.0MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1115.02ms. Allocated memory is still 174.1MB. Free memory was 141.5MB in the beginning and 126.6MB in the end (delta: 14.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.39ms. Allocated memory is still 174.1MB. Free memory was 126.6MB in the beginning and 124.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.73ms. Allocated memory is still 174.1MB. Free memory was 124.5MB in the beginning and 122.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.00ms. Allocated memory is still 174.1MB. Free memory was 121.4MB in the beginning and 106.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1777.22ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 105.7MB in the beginning and 89.3MB in the end (delta: 16.4MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Witness Printer took 65.74ms. Allocated memory is still 209.7MB. Free memory was 89.3MB in the beginning and 86.2MB 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_preinc_65b_goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_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: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 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: ((2147483647 <= \old()) || (2 == \old())) Ensures: ((2147483647 <= \old()) || (2 == \old())) * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-11 22:29:00,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_65_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d2471229a970f2e81daebfd2aacac11bb45cd3b2712bd2a124cea60d0cd4cc3f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:29:02,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:29:02,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-11 22:29:02,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:29:02,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:29:02,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-11 22:29:02,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:29:02,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:29:02,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:29:02,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:29:02,535 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:29:02,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:29:02,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:29:02,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:29:02,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:29:02,537 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:29:02,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:29:02,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:29:02,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:29:02,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:29:02,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:29:02,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:29:02,543 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 22:29:02,543 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 22:29:02,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:29:02,543 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:29:02,544 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 22:29:02,544 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:29:02,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:29:02,544 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:29:02,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:29:02,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:29:02,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:29:02,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:29:02,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:29:02,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:29:02,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:29:02,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:29:02,547 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 22:29:02,547 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 22:29:02,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:29:02,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:29:02,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:29:02,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:29:02,549 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 22:29:02,550 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2471229a970f2e81daebfd2aacac11bb45cd3b2712bd2a124cea60d0cd4cc3f [2024-10-11 22:29:02,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:29:02,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:29:02,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:29:02,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:29:02,916 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:29:02,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_65_good.i [2024-10-11 22:29:04,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:29:04,815 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:29:04,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_65_good.i [2024-10-11 22:29:04,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b94488f7b/1de125e14b104abc96df08a7f35a1e18/FLAGe03ad3e49 [2024-10-11 22:29:05,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b94488f7b/1de125e14b104abc96df08a7f35a1e18 [2024-10-11 22:29:05,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:29:05,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:29:05,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:29:05,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:29:05,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:29:05,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:29:05" (1/1) ... [2024-10-11 22:29:05,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4c48ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:05, skipping insertion in model container [2024-10-11 22:29:05,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:29:05" (1/1) ... [2024-10-11 22:29:05,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:29:05,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:29:05,840 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:29:05,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:29:06,100 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:29:06,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06 WrapperNode [2024-10-11 22:29:06,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:29:06,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:29:06,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:29:06,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:29:06,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,176 INFO L138 Inliner]: procedures = 507, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 67 [2024-10-11 22:29:06,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:29:06,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:29:06,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:29:06,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:29:06,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,210 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:29:06,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:29:06,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:29:06,231 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:29:06,231 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:29:06,232 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (1/1) ... [2024-10-11 22:29:06,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:29:06,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:29:06,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:29:06,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:29:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:29:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:29:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:29:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:29:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:29:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_INT~TO~VOID [2024-10-11 22:29:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_INT~TO~VOID [2024-10-11 22:29:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:29:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:29:06,462 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:29:06,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:29:06,657 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-11 22:29:06,659 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:29:06,695 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:29:06,695 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:29:06,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:29:06 BoogieIcfgContainer [2024-10-11 22:29:06,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:29:06,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:29:06,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:29:06,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:29:06,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:29:05" (1/3) ... [2024-10-11 22:29:06,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5897ece5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:29:06, skipping insertion in model container [2024-10-11 22:29:06,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:29:06" (2/3) ... [2024-10-11 22:29:06,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5897ece5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:29:06, skipping insertion in model container [2024-10-11 22:29:06,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:29:06" (3/3) ... [2024-10-11 22:29:06,705 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_preinc_65_good.i [2024-10-11 22:29:06,721 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:29:06,721 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 22:29:06,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:29:06,792 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;@11b137f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:29:06,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 22:29:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 22:29:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:29:06,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:29:06,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:29:06,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:29:06,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:29:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1877852356, now seen corresponding path program 1 times [2024-10-11 22:29:06,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:29:06,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368101665] [2024-10-11 22:29:06,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:29:06,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:29:06,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:29:06,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:29:06,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 22:29:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:29:06,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 22:29:06,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:29:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:29:06,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:29:06,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:29:06,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368101665] [2024-10-11 22:29:06,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368101665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:29:06,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:29:06,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 22:29:06,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955817386] [2024-10-11 22:29:06,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:29:06,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 22:29:06,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:29:07,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 22:29:07,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:29:07,015 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:29:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:29:07,046 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-11 22:29:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 22:29:07,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 22:29:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:29:07,055 INFO L225 Difference]: With dead ends: 36 [2024-10-11 22:29:07,055 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 22:29:07,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:29:07,063 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:29:07,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:29:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 22:29:07,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 22:29:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:29:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-11 22:29:07,100 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2024-10-11 22:29:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:29:07,101 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-11 22:29:07,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:29:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-11 22:29:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:29:07,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:29:07,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:29:07,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 22:29:07,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:29:07,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:29:07,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:29:07,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1916119026, now seen corresponding path program 1 times [2024-10-11 22:29:07,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:29:07,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924273162] [2024-10-11 22:29:07,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:29:07,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:29:07,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:29:07,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:29:07,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 22:29:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:29:07,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 22:29:07,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:29:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:29:07,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:29:07,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:29:07,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924273162] [2024-10-11 22:29:07,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924273162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:29:07,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:29:07,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:29:07,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981350798] [2024-10-11 22:29:07,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:29:07,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:29:07,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:29:07,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:29:07,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:29:07,529 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:29:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:29:07,640 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-10-11 22:29:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:29:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 22:29:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:29:07,642 INFO L225 Difference]: With dead ends: 48 [2024-10-11 22:29:07,642 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 22:29:07,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 22:29:07,643 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:29:07,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 129 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:29:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 22:29:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-10-11 22:29:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:29:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-11 22:29:07,658 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 12 [2024-10-11 22:29:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:29:07,658 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-11 22:29:07,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:29:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-11 22:29:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 22:29:07,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:29:07,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:29:07,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 22:29:07,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:29:07,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:29:07,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:29:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash 729330087, now seen corresponding path program 1 times [2024-10-11 22:29:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:29:07,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216179133] [2024-10-11 22:29:07,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:29:07,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:29:07,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:29:07,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:29:07,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 22:29:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:29:07,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 22:29:07,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:29:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:29:07,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:29:07,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:29:07,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216179133] [2024-10-11 22:29:07,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216179133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:29:07,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:29:07,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:29:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206365076] [2024-10-11 22:29:07,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:29:07,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:29:07,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:29:07,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:29:07,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:29:07,975 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:29:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:29:08,008 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-10-11 22:29:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:29:08,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 22:29:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:29:08,010 INFO L225 Difference]: With dead ends: 56 [2024-10-11 22:29:08,010 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 22:29:08,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:29:08,012 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:29:08,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 51 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:29:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 22:29:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 22:29:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 22:29:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2024-10-11 22:29:08,018 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2024-10-11 22:29:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:29:08,019 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2024-10-11 22:29:08,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:29:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2024-10-11 22:29:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 22:29:08,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:29:08,020 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:29:08,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 22:29:08,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:29:08,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:29:08,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:29:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash 620713822, now seen corresponding path program 1 times [2024-10-11 22:29:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:29:08,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321319487] [2024-10-11 22:29:08,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:29:08,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:29:08,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:29:08,229 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:29:08,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 22:29:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:29:08,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 22:29:08,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:29:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:29:08,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:29:08,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:29:08,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321319487] [2024-10-11 22:29:08,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321319487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:29:08,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:29:08,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:29:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212567635] [2024-10-11 22:29:08,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:29:08,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:29:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:29:08,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:29:08,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:29:08,376 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:29:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:29:08,413 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2024-10-11 22:29:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:29:08,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-10-11 22:29:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:29:08,416 INFO L225 Difference]: With dead ends: 29 [2024-10-11 22:29:08,416 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 22:29:08,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:29:08,418 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:29:08,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:29:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 22:29:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 22:29:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 22:29:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-11 22:29:08,424 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2024-10-11 22:29:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:29:08,424 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-11 22:29:08,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:29:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-11 22:29:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 22:29:08,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:29:08,426 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:29:08,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 22:29:08,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:29:08,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 22:29:08,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:29:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2061737047, now seen corresponding path program 1 times [2024-10-11 22:29:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:29:08,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746982841] [2024-10-11 22:29:08,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:29:08,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:29:08,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:29:08,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:29:08,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 22:29:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:29:08,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 22:29:08,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:29:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:29:08,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:29:08,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:29:08,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746982841] [2024-10-11 22:29:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746982841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:29:08,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:29:08,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 22:29:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577165968] [2024-10-11 22:29:08,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:29:08,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:29:08,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:29:08,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:29:08,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:29:08,775 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:29:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:29:08,833 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2024-10-11 22:29:08,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:29:08,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-11 22:29:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:29:08,834 INFO L225 Difference]: With dead ends: 26 [2024-10-11 22:29:08,834 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:29:08,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 22:29:08,835 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:29:08,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:29:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:29:08,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:29:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 22:29:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:29:08,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-10-11 22:29:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:29:08,841 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:29:08,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:29:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:29:08,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:29:08,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 22:29:08,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 22:29:08,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 22:29:08,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 22:29:08,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 22:29:09,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:29:09,052 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 22:29:09,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:29:09,195 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:29:09,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodG2BSink.offset [2024-10-11 22:29:09,216 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:29:09,216 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:29:09,216 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.base [2024-10-11 22:29:09,216 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:29:09,216 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.offset [2024-10-11 22:29:09,217 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodG2BSink.offset [2024-10-11 22:29:09,217 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:29:09,217 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 22:29:09,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.base [2024-10-11 22:29:09,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 22:29:09,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.offset [2024-10-11 22:29:09,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:29:09 BoogieIcfgContainer [2024-10-11 22:29:09,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:29:09,219 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:29:09,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:29:09,220 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:29:09,220 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:29:06" (3/4) ... [2024-10-11 22:29:09,222 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:29:09,226 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:29:09,226 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:29:09,227 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~C_INT~TO~VOID [2024-10-11 22:29:09,230 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-11 22:29:09,231 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 22:29:09,231 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 22:29:09,231 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:29:09,281 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitnessLocation(YamlCorrectnessWitnessGenerator.java:111) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.extractFunctionContracts(YamlCorrectnessWitnessGenerator.java:104) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitness(YamlCorrectnessWitnessGenerator.java:66) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.makeYamlString(YamlCorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:170) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:140) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:130) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-11 22:29:09,285 INFO L158 Benchmark]: Toolchain (without parser) took 4245.19ms. Allocated memory was 65.0MB in the beginning and 100.7MB in the end (delta: 35.7MB). Free memory was 44.4MB in the beginning and 69.5MB in the end (delta: -25.1MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2024-10-11 22:29:09,285 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:29:09,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1058.90ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 44.1MB in the beginning and 45.2MB in the end (delta: -1.0MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-10-11 22:29:09,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.34ms. Allocated memory is still 81.8MB. Free memory was 45.2MB in the beginning and 41.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:29:09,286 INFO L158 Benchmark]: Boogie Preprocessor took 52.15ms. Allocated memory is still 81.8MB. Free memory was 41.8MB in the beginning and 39.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:29:09,286 INFO L158 Benchmark]: RCFGBuilder took 465.85ms. Allocated memory is still 81.8MB. Free memory was 39.3MB in the beginning and 43.0MB in the end (delta: -3.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-10-11 22:29:09,287 INFO L158 Benchmark]: TraceAbstraction took 2520.77ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 42.1MB in the beginning and 41.4MB in the end (delta: 719.5kB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-10-11 22:29:09,287 INFO L158 Benchmark]: Witness Printer took 65.04ms. Allocated memory is still 100.7MB. Free memory was 41.4MB in the beginning and 69.5MB in the end (delta: -28.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:29:09,288 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.18ms. Allocated memory is still 50.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1058.90ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 44.1MB in the beginning and 45.2MB in the end (delta: -1.0MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.34ms. Allocated memory is still 81.8MB. Free memory was 45.2MB in the beginning and 41.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.15ms. Allocated memory is still 81.8MB. Free memory was 41.8MB in the beginning and 39.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.85ms. Allocated memory is still 81.8MB. Free memory was 39.3MB in the beginning and 43.0MB in the end (delta: -3.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2520.77ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 42.1MB in the beginning and 41.4MB in the end (delta: 719.5kB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Witness Printer took 65.04ms. Allocated memory is still 100.7MB. Free memory was 41.4MB in the beginning and 69.5MB in the end (delta: -28.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_preinc_65b_goodG2BSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodG2BSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_65b_goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE190_Integer_Overflow__int_max_preinc_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: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, 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.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 354 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 232 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 122 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=2, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 122 SizeOfPredicates, 3 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - ProcedureContractResult [Line: -1]: Procedure Contract for ##fun~C_INT~TO~VOID Derived contract for procedure ##fun~C_INT~TO~VOID. Requires: ((2 == \old()) || (2147483647 == \old())) Ensures: ((2 == \old()) || (2147483647 == \old())) * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-11 22:29:09,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null