./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4751d3eb3f8125549e47ad071da84be7a54e1805eb31936796833555d65c49e8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 20:18:12,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:18:12,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 20:18:12,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:18:12,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:18:12,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:18:12,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:18:12,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:18:12,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:18:12,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:18:12,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:18:12,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:18:12,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:18:12,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:18:12,660 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:18:12,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:18:12,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:18:12,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:18:12,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 20:18:12,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:18:12,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:18:12,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:18:12,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:18:12,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:18:12,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:18:12,666 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:18:12,666 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:18:12,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:18:12,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:18:12,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:18:12,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:18:12,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:18:12,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:18:12,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:18:12,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:18:12,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:18:12,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:18:12,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:18:12,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 20:18:12,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 20:18:12,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:18:12,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:18:12,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:18:12,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:18:12,670 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4751d3eb3f8125549e47ad071da84be7a54e1805eb31936796833555d65c49e8 [2024-10-24 20:18:12,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:18:12,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:18:12,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:18:12,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:18:12,887 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:18:12,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound5.c [2024-10-24 20:18:14,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:18:14,261 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:18:14,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound5.c [2024-10-24 20:18:14,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb80c1542/c89c0bf5014244028e75f671075f7bce/FLAG1e0aa5a24 [2024-10-24 20:18:14,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb80c1542/c89c0bf5014244028e75f671075f7bce [2024-10-24 20:18:14,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:18:14,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:18:14,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:18:14,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:18:14,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:18:14,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1a5274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14, skipping insertion in model container [2024-10-24 20:18:14,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:18:14,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:18:14,460 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:18:14,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:18:14,487 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:18:14,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14 WrapperNode [2024-10-24 20:18:14,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:18:14,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:18:14,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:18:14,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:18:14,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,513 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-10-24 20:18:14,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:18:14,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:18:14,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:18:14,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:18:14,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,530 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 20:18:14,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:18:14,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:18:14,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:18:14,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:18:14,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (1/1) ... [2024-10-24 20:18:14,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:18:14,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:18:14,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 20:18:14,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 20:18:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:18:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 20:18:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:18:14,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:18:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 20:18:14,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 20:18:14,707 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:18:14,709 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 20:18:14,933 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-24 20:18:14,933 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 20:18:14,949 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 20:18:14,949 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 20:18:14,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:18:14 BoogieIcfgContainer [2024-10-24 20:18:14,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 20:18:14,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 20:18:14,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 20:18:14,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 20:18:14,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:18:14" (1/3) ... [2024-10-24 20:18:14,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de78236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:18:14, skipping insertion in model container [2024-10-24 20:18:14,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:18:14" (2/3) ... [2024-10-24 20:18:14,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de78236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:18:14, skipping insertion in model container [2024-10-24 20:18:14,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:18:14" (3/3) ... [2024-10-24 20:18:14,955 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-u2_unwindbound5.c [2024-10-24 20:18:14,969 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 20:18:14,970 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-10-24 20:18:15,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 20:18:15,038 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;@38441a81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 20:18:15,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-10-24 20:18:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 32 states have (on average 1.875) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:18:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 20:18:15,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:18:15,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 20:18:15,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 20:18:15,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:18:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash 118428, now seen corresponding path program 1 times [2024-10-24 20:18:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:18:15,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638295747] [2024-10-24 20:18:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:18:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:15,248 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-24 20:18:15,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:18:15,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638295747] [2024-10-24 20:18:15,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638295747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:18:15,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:18:15,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:18:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036702982] [2024-10-24 20:18:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:18:15,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:18:15,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:18:15,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:18:15,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:18:15,270 INFO L87 Difference]: Start difference. First operand has 60 states, 32 states have (on average 1.875) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:18:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:18:15,318 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2024-10-24 20:18:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:18:15,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 20:18:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:18:15,325 INFO L225 Difference]: With dead ends: 123 [2024-10-24 20:18:15,325 INFO L226 Difference]: Without dead ends: 61 [2024-10-24 20:18:15,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:18:15,329 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:18:15,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 166 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:18:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-24 20:18:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-24 20:18:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 58 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:18:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2024-10-24 20:18:15,355 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 3 [2024-10-24 20:18:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:18:15,355 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2024-10-24 20:18:15,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:18:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2024-10-24 20:18:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 20:18:15,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:18:15,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 20:18:15,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 20:18:15,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 20:18:15,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:18:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash -766837873, now seen corresponding path program 1 times [2024-10-24 20:18:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:18:15,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127894832] [2024-10-24 20:18:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:18:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:18:15,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789854926] [2024-10-24 20:18:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:15,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:18:15,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:18:15,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:18:15,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 20:18:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:15,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:18:15,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:18:15,420 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-24 20:18:15,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:18:15,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:18:15,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127894832] [2024-10-24 20:18:15,421 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:18:15,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789854926] [2024-10-24 20:18:15,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789854926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:18:15,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:18:15,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 20:18:15,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110388727] [2024-10-24 20:18:15,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:18:15,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:18:15,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:18:15,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:18:15,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:18:15,423 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:18:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:18:15,496 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-10-24 20:18:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:18:15,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 20:18:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:18:15,497 INFO L225 Difference]: With dead ends: 91 [2024-10-24 20:18:15,497 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 20:18:15,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:18:15,498 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:18:15,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 61 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:18:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 20:18:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-10-24 20:18:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:18:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-10-24 20:18:15,506 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 6 [2024-10-24 20:18:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:18:15,507 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-10-24 20:18:15,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:18:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-10-24 20:18:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 20:18:15,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:18:15,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:18:15,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 20:18:15,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:18:15,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 20:18:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:18:15,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1984700563, now seen corresponding path program 1 times [2024-10-24 20:18:15,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:18:15,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139586272] [2024-10-24 20:18:15,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:18:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:18:15,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444596239] [2024-10-24 20:18:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:15,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:18:15,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:18:15,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:18:15,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 20:18:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:15,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:18:15,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:18:15,819 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-24 20:18:15,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:18:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:18:15,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139586272] [2024-10-24 20:18:15,820 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:18:15,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444596239] [2024-10-24 20:18:15,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444596239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:18:15,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:18:15,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 20:18:15,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435067963] [2024-10-24 20:18:15,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:18:15,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:18:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:18:15,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:18:15,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:18:15,822 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:18:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:18:15,892 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-10-24 20:18:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:18:15,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 20:18:15,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:18:15,894 INFO L225 Difference]: With dead ends: 83 [2024-10-24 20:18:15,894 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 20:18:15,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:18:15,896 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:18:15,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 59 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:18:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 20:18:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-10-24 20:18:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 75 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:18:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-10-24 20:18:15,902 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 10 [2024-10-24 20:18:15,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:18:15,903 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-10-24 20:18:15,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:18:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-10-24 20:18:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 20:18:15,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:18:15,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:18:15,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 20:18:16,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 20:18:16,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 20:18:16,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:18:16,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1396175367, now seen corresponding path program 1 times [2024-10-24 20:18:16,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:18:16,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634740923] [2024-10-24 20:18:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:16,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:18:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:16,296 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-24 20:18:16,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:18:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634740923] [2024-10-24 20:18:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634740923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:18:16,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:18:16,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:18:16,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261952501] [2024-10-24 20:18:16,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:18:16,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:18:16,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:18:16,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:18:16,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:18:16,298 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-24 20:18:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:18:16,361 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-10-24 20:18:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:18:16,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-24 20:18:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:18:16,362 INFO L225 Difference]: With dead ends: 83 [2024-10-24 20:18:16,362 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 20:18:16,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:18:16,363 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 30 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:18:16,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 61 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:18:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 20:18:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-10-24 20:18:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 75 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:18:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-10-24 20:18:16,368 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 11 [2024-10-24 20:18:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:18:16,369 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-10-24 20:18:16,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-24 20:18:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-10-24 20:18:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 20:18:16,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:18:16,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:18:16,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 20:18:16,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 20:18:16,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:18:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1158687737, now seen corresponding path program 1 times [2024-10-24 20:18:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:18:16,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168793165] [2024-10-24 20:18:16,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:16,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:18:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:16,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 20:18:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:16,424 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-24 20:18:16,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:18:16,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168793165] [2024-10-24 20:18:16,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168793165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:18:16,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:18:16,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:18:16,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137990188] [2024-10-24 20:18:16,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:18:16,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:18:16,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:18:16,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:18:16,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:18:16,426 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:18:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:18:16,439 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-10-24 20:18:16,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:18:16,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-24 20:18:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:18:16,440 INFO L225 Difference]: With dead ends: 81 [2024-10-24 20:18:16,440 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 20:18:16,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:18:16,441 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:18:16,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:18:16,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 20:18:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-24 20:18:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.5) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:18:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-10-24 20:18:16,445 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 20 [2024-10-24 20:18:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:18:16,446 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-10-24 20:18:16,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:18:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-10-24 20:18:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 20:18:16,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:18:16,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:18:16,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 20:18:16,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 20:18:16,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:18:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1102347184, now seen corresponding path program 1 times [2024-10-24 20:18:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:18:16,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842882827] [2024-10-24 20:18:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:18:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:16,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 20:18:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:16,553 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-24 20:18:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:18:16,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842882827] [2024-10-24 20:18:16,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842882827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:18:16,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:18:16,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:18:16,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638101190] [2024-10-24 20:18:16,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:18:16,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:18:16,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:18:16,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:18:16,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:18:16,559 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:18:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:18:17,158 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-10-24 20:18:17,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:18:17,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-24 20:18:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:18:17,160 INFO L225 Difference]: With dead ends: 79 [2024-10-24 20:18:17,160 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 20:18:17,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:18:17,161 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 20:18:17,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 75 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 20:18:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 20:18:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 20:18:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:18:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-10-24 20:18:17,166 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 22 [2024-10-24 20:18:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:18:17,166 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-10-24 20:18:17,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:18:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-10-24 20:18:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 20:18:17,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:18:17,167 INFO L215 NwaCegarLoop]: trace histogram [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-24 20:18:17,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 20:18:17,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 20:18:17,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:18:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash -186975569, now seen corresponding path program 1 times [2024-10-24 20:18:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:18:17,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315485031] [2024-10-24 20:18:17,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:18:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:18:17,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646921484] [2024-10-24 20:18:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:17,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:18:17,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:18:17,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:18:17,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 20:18:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:17,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:18:17,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:18:17,294 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-24 20:18:17,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:18:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:18:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315485031] [2024-10-24 20:18:17,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:18:17,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646921484] [2024-10-24 20:18:17,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646921484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:18:17,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:18:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:18:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996152428] [2024-10-24 20:18:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:18:17,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:18:17,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:18:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:18:17,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:18:17,296 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:18:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:18:17,400 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-10-24 20:18:17,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:18:17,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 20:18:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:18:17,402 INFO L225 Difference]: With dead ends: 83 [2024-10-24 20:18:17,402 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 20:18:17,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:18:17,402 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:18:17,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 81 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:18:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 20:18:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-10-24 20:18:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.462962962962963) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:18:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-10-24 20:18:17,410 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 23 [2024-10-24 20:18:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:18:17,410 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-10-24 20:18:17,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:18:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-10-24 20:18:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 20:18:17,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:18:17,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:18:17,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 20:18:17,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:18:17,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 20:18:17,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:18:17,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1501275246, now seen corresponding path program 1 times [2024-10-24 20:18:17,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:18:17,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162262974] [2024-10-24 20:18:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:18:17,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:18:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:21,722 WARN L873 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main_~y~0#1| 4294967296) (< (* |c_ULTIMATE.start_main_~x~0#1| (div (+ 4294967295 |c_ULTIMATE.start_main_~z~0#1|) 4294967296)) (+ 2147483649 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~x~0#1| (div |c_ULTIMATE.start_main_~z~0#1| 4294967296))))) is different from true [2024-10-24 20:18:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 20:18:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:18:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:18:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:18:42,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162262974] [2024-10-24 20:18:42,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162262974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:18:42,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:18:42,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 20:18:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852859919] [2024-10-24 20:18:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:18:42,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 20:18:42,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:18:42,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 20:18:42,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-10-24 20:18:42,030 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:18:43,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:18:48,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:18:51,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:18:55,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:18:59,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:02,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:06,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:07,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:11,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:15,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:19,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:21,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:25,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:27,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:31,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:33,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:36,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:40,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:43,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:47,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:51,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:19:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:19:52,196 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-10-24 20:19:52,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 20:19:52,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-24 20:19:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:19:52,197 INFO L225 Difference]: With dead ends: 84 [2024-10-24 20:19:52,197 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 20:19:52,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2024-10-24 20:19:52,198 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 41 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 70.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:19:52,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 151 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 8 Unknown, 75 Unchecked, 70.1s Time] [2024-10-24 20:19:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 20:19:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-10-24 20:19:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 77 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:19:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-10-24 20:19:52,203 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 24 [2024-10-24 20:19:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:19:52,203 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-10-24 20:19:52,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:19:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-10-24 20:19:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 20:19:52,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:19:52,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:19:52,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 20:19:52,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 20:19:52,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:19:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash 705107729, now seen corresponding path program 1 times [2024-10-24 20:19:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:19:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500563552] [2024-10-24 20:19:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:19:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:19:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:19:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 20:19:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:19:52,275 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-24 20:19:52,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:19:52,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500563552] [2024-10-24 20:19:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500563552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:19:52,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:19:52,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:19:52,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090295729] [2024-10-24 20:19:52,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:19:52,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:19:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:19:52,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:19:52,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:19:52,277 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:19:56,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:20:00,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:20:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:20:00,401 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-10-24 20:20:00,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:20:00,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-24 20:20:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:20:00,402 INFO L225 Difference]: With dead ends: 81 [2024-10-24 20:20:00,402 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 20:20:00,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:20:00,403 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 53 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:20:00,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 52 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2024-10-24 20:20:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 20:20:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 20:20:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 69 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:20:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2024-10-24 20:20:00,413 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 25 [2024-10-24 20:20:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:20:00,413 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-10-24 20:20:00,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:20:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2024-10-24 20:20:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 20:20:00,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:20:00,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:20:00,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 20:20:00,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 20:20:00,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:20:00,417 INFO L85 PathProgramCache]: Analyzing trace with hash 685311989, now seen corresponding path program 1 times [2024-10-24 20:20:00,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:20:00,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252912281] [2024-10-24 20:20:00,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:20:00,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:20:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:20:00,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614474822] [2024-10-24 20:20:00,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:20:00,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:20:00,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:20:00,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:20:00,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 20:20:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 20:20:00,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 20:20:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 20:20:00,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 20:20:00,482 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 20:20:00,483 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2024-10-24 20:20:00,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2024-10-24 20:20:00,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2024-10-24 20:20:00,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2024-10-24 20:20:00,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2024-10-24 20:20:00,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2024-10-24 20:20:00,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2024-10-24 20:20:00,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2024-10-24 20:20:00,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2024-10-24 20:20:00,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2024-10-24 20:20:00,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2024-10-24 20:20:00,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2024-10-24 20:20:00,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2024-10-24 20:20:00,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2024-10-24 20:20:00,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2024-10-24 20:20:00,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2024-10-24 20:20:00,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2024-10-24 20:20:00,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2024-10-24 20:20:00,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2024-10-24 20:20:00,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2024-10-24 20:20:00,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2024-10-24 20:20:00,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2024-10-24 20:20:00,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2024-10-24 20:20:00,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2024-10-24 20:20:00,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 20:20:00,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:20:00,690 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:20:00,714 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 20:20:00,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:20:00 BoogieIcfgContainer [2024-10-24 20:20:00,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 20:20:00,718 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 20:20:00,718 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 20:20:00,718 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 20:20:00,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:18:14" (3/4) ... [2024-10-24 20:20:00,719 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 20:20:00,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 20:20:00,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 20:20:00,757 INFO L158 Benchmark]: Toolchain (without parser) took 106470.80ms. Allocated memory is still 190.8MB. Free memory was 124.8MB in the beginning and 132.3MB in the end (delta: -7.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:20:00,757 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 113.2MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:20:00,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.35ms. Allocated memory is still 190.8MB. Free memory was 124.6MB in the beginning and 112.4MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 20:20:00,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.76ms. Allocated memory is still 190.8MB. Free memory was 112.4MB in the beginning and 110.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 20:20:00,757 INFO L158 Benchmark]: Boogie Preprocessor took 23.47ms. Allocated memory is still 190.8MB. Free memory was 110.5MB in the beginning and 108.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 20:20:00,757 INFO L158 Benchmark]: RCFGBuilder took 412.27ms. Allocated memory is still 190.8MB. Free memory was 108.7MB in the beginning and 148.2MB in the end (delta: -39.6MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-10-24 20:20:00,758 INFO L158 Benchmark]: TraceAbstraction took 105766.30ms. Allocated memory is still 190.8MB. Free memory was 148.2MB in the beginning and 134.4MB in the end (delta: 13.9MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-10-24 20:20:00,758 INFO L158 Benchmark]: Witness Printer took 38.81ms. Allocated memory is still 190.8MB. Free memory was 134.4MB in the beginning and 132.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 20:20:00,759 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.10ms. Allocated memory is still 113.2MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.35ms. Allocated memory is still 190.8MB. Free memory was 124.6MB in the beginning and 112.4MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.76ms. Allocated memory is still 190.8MB. Free memory was 112.4MB in the beginning and 110.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.47ms. Allocated memory is still 190.8MB. Free memory was 110.5MB in the beginning and 108.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.27ms. Allocated memory is still 190.8MB. Free memory was 108.7MB in the beginning and 148.2MB in the end (delta: -39.6MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * TraceAbstraction took 105766.30ms. Allocated memory is still 190.8MB. Free memory was 148.2MB in the beginning and 134.4MB in the end (delta: 13.9MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Witness Printer took 38.81ms. Allocated memory is still 190.8MB. Free memory was 134.4MB in the beginning and 132.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: integer overflow possible integer overflow possible We found a FailurePath: [L22] int counter = 0; [L24] unsigned int z, k; [L25] long long x, y, c; [L26] z = __VERIFIER_nondet_uint() [L27] k = __VERIFIER_nondet_uint() [L29] x = 1 [L30] y = z [L31] c = 1 VAL [c=1, counter=0, x=1, y=3037000500, z=7331967796] [L33] EXPR counter++ VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L33] COND TRUE counter++<5 [L34] EXPR x*z VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L34] EXPR x*z - x VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L34] EXPR x*z - x - y VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L34] EXPR x*z - x - y + 1 VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L34] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L36] COND FALSE !(!(c < k)) VAL [c=1, counter=1, k=2, x=1, y=3037000500, z=7331967796] [L39] EXPR c + 1 [L39] c = c + 1 VAL [c=2, counter=1, k=2, x=1, y=3037000500, z=7331967796] [L40] EXPR x * z VAL [c=2, counter=1, k=2, x=1, y=3037000500, z=7331967796] [L40] EXPR x * z + 1 [L40] x = x * z + 1 VAL [c=2, counter=1, k=2, x=3037000501, y=3037000500, z=7331967796] [L41] y * z VAL [c=2, counter=1, k=2, x=3037000501] - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 105.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 79.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 214 SdHoareTripleChecker+Valid, 79.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 810 SdHoareTripleChecker+Invalid, 78.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 75 IncrementalHoareTripleChecker+Unchecked, 439 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 371 mSDtfsCounter, 634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=8, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 20:20:00,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)