./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-nla/hard2-both-nt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/termination-nla/hard2-both-nt.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 23ac641bc90237de255e915a5ed362430f6ac59f0f6642be7f9d8479ff0a7576 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:16:01,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:16:01,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:16:01,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:16:01,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:16:02,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:16:02,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:16:02,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:16:02,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:16:02,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:16:02,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:16:02,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:16:02,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:16:02,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:16:02,032 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:16:02,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:16:02,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:16:02,033 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:16:02,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:16:02,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:16:02,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:16:02,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:16:02,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:16:02,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:16:02,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:16:02,037 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:16:02,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:16:02,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:16:02,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:16:02,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:16:02,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:16:02,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:16:02,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:16:02,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:16:02,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:16:02,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:16:02,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:16:02,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:16:02,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:16:02,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:16:02,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:16:02,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:16:02,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:16:02,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:16:02,044 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 -> 23ac641bc90237de255e915a5ed362430f6ac59f0f6642be7f9d8479ff0a7576 [2024-11-19 10:16:02,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:16:02,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:16:02,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:16:02,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:16:02,354 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:16:02,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-nla/hard2-both-nt.c [2024-11-19 10:16:03,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:16:04,384 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:16:04,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-nla/hard2-both-nt.c [2024-11-19 10:16:04,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17dedb198/11b85e652b51411690a0b226d082b8ab/FLAG0c5f0b098 [2024-11-19 10:16:04,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17dedb198/11b85e652b51411690a0b226d082b8ab [2024-11-19 10:16:04,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:16:04,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:16:04,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:16:04,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:16:04,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:16:04,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:04,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1526a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04, skipping insertion in model container [2024-11-19 10:16:04,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:04,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:16:04,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:16:04,859 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:16:04,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:16:04,924 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:16:04,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04 WrapperNode [2024-11-19 10:16:04,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:16:04,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:16:04,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:16:04,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:16:04,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:04,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:04,967 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-19 10:16:04,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:16:04,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:16:04,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:16:04,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:16:04,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:04,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:04,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:04,997 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 10:16:04,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:04,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:05,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:05,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:05,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:05,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:05,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:16:05,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:16:05,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:16:05,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:16:05,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (1/1) ... [2024-11-19 10:16:05,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:16:05,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:05,105 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-11-19 10:16:05,230 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-11-19 10:16:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:16:05,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:16:05,444 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:16:05,452 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:16:05,718 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-19 10:16:05,719 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:16:05,735 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:16:05,735 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:16:05,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:16:05 BoogieIcfgContainer [2024-11-19 10:16:05,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:16:05,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:16:05,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:16:05,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:16:05,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:16:04" (1/3) ... [2024-11-19 10:16:05,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761164f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:16:05, skipping insertion in model container [2024-11-19 10:16:05,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:16:04" (2/3) ... [2024-11-19 10:16:05,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761164f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:16:05, skipping insertion in model container [2024-11-19 10:16:05,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:16:05" (3/3) ... [2024-11-19 10:16:05,749 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2-both-nt.c [2024-11-19 10:16:05,767 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:16:05,767 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-11-19 10:16:05,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:16:05,840 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;@10ffb530, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:16:05,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-11-19 10:16:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 46 states have internal predecessors, (53), 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-11-19 10:16:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 10:16:05,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:05,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 10:16:05,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:05,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2024-11-19 10:16:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:05,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952048793] [2024-11-19 10:16:05,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:05,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:16:05,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660452548] [2024-11-19 10:16:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:05,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:05,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:05,987 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-11-19 10:16:05,989 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-11-19 10:16:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:06,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:16:06,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:06,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:16:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:06,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952048793] [2024-11-19 10:16:06,118 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:16:06,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660452548] [2024-11-19 10:16:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660452548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:06,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:06,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:16:06,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698948318] [2024-11-19 10:16:06,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:06,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:16:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:06,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:16:06,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:16:06,161 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 46 states have internal predecessors, (53), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-19 10:16:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:06,267 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-11-19 10:16:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:16:06,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-19 10:16:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:06,276 INFO L225 Difference]: With dead ends: 104 [2024-11-19 10:16:06,277 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 10:16:06,279 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-11-19 10:16:06,282 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:06,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 50 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 10:16:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2024-11-19 10:16:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 60 states have internal predecessors, (72), 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-11-19 10:16:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2024-11-19 10:16:06,320 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 4 [2024-11-19 10:16:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:06,320 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2024-11-19 10:16:06,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-19 10:16:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2024-11-19 10:16:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 10:16:06,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:06,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:06,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:16:06,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 10:16:06,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:06,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:06,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629707, now seen corresponding path program 1 times [2024-11-19 10:16:06,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:06,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429022362] [2024-11-19 10:16:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:06,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429022362] [2024-11-19 10:16:06,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429022362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:06,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:06,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:16:06,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269773779] [2024-11-19 10:16:06,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:06,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:16:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:06,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:16:06,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:16:06,617 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-11-19 10:16:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:06,661 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2024-11-19 10:16:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:16:06,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-19 10:16:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:06,664 INFO L225 Difference]: With dead ends: 74 [2024-11-19 10:16:06,667 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 10:16:06,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-19 10:16:06,669 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 55 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-11-19 10:16:06,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 55 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:16:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 10:16:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2024-11-19 10:16:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.6) internal successors, (80), 66 states have internal predecessors, (80), 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-11-19 10:16:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2024-11-19 10:16:06,681 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 7 [2024-11-19 10:16:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:06,682 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2024-11-19 10:16:06,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-11-19 10:16:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2024-11-19 10:16:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:16:06,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:06,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:06,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:16:06,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:06,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash 294944745, now seen corresponding path program 1 times [2024-11-19 10:16:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:06,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731878313] [2024-11-19 10:16:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:16:06,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33213721] [2024-11-19 10:16:06,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:06,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:06,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:06,708 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-11-19 10:16:06,711 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-11-19 10:16:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:06,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:16:06,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:06,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:16:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731878313] [2024-11-19 10:16:06,784 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:16:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33213721] [2024-11-19 10:16:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33213721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:16:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711067271] [2024-11-19 10:16:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:06,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:16:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:06,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:16:06,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:16:06,787 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 10:16:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:06,864 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2024-11-19 10:16:06,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:16:06,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-19 10:16:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:06,867 INFO L225 Difference]: With dead ends: 90 [2024-11-19 10:16:06,867 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 10:16:06,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-19 10:16:06,868 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:06,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 10:16:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2024-11-19 10:16:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.540983606557377) internal successors, (94), 77 states have internal predecessors, (94), 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-11-19 10:16:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2024-11-19 10:16:06,879 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 8 [2024-11-19 10:16:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:06,879 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2024-11-19 10:16:06,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 10:16:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2024-11-19 10:16:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:16:06,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:06,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:06,895 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-11-19 10:16:07,081 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-11-19 10:16:07,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:07,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:07,082 INFO L85 PathProgramCache]: Analyzing trace with hash 294946123, now seen corresponding path program 1 times [2024-11-19 10:16:07,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:07,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415552618] [2024-11-19 10:16:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:07,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:07,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:07,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415552618] [2024-11-19 10:16:07,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415552618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:07,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:07,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:16:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986142906] [2024-11-19 10:16:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:07,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:16:07,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:07,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:16:07,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:16:07,142 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 10:16:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:07,200 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2024-11-19 10:16:07,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:16:07,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-19 10:16:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:07,202 INFO L225 Difference]: With dead ends: 114 [2024-11-19 10:16:07,202 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 10:16:07,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-19 10:16:07,203 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:07,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 61 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:16:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 10:16:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2024-11-19 10:16:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 103 states have internal predecessors, (136), 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-11-19 10:16:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2024-11-19 10:16:07,215 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 8 [2024-11-19 10:16:07,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:07,215 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2024-11-19 10:16:07,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 10:16:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2024-11-19 10:16:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:16:07,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:07,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:07,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:16:07,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:07,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:07,217 INFO L85 PathProgramCache]: Analyzing trace with hash -25939253, now seen corresponding path program 1 times [2024-11-19 10:16:07,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:07,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702976624] [2024-11-19 10:16:07,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:07,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:16:07,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577063467] [2024-11-19 10:16:07,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:07,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:07,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:07,227 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-11-19 10:16:07,228 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-11-19 10:16:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:07,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:16:07,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:07,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:16:07,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:07,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702976624] [2024-11-19 10:16:07,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:16:07,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577063467] [2024-11-19 10:16:07,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577063467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:07,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:07,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:16:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181688445] [2024-11-19 10:16:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:07,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:16:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:07,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:16:07,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:16:07,402 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11-19 10:16:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:07,567 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2024-11-19 10:16:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:16:07,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11-19 10:16:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:07,570 INFO L225 Difference]: With dead ends: 113 [2024-11-19 10:16:07,570 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 10:16:07,570 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-11-19 10:16:07,583 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:07,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 10:16:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2024-11-19 10:16:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.5172413793103448) internal successors, (132), 103 states have internal predecessors, (132), 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-11-19 10:16:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2024-11-19 10:16:07,613 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 10 [2024-11-19 10:16:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:07,614 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2024-11-19 10:16:07,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11-19 10:16:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2024-11-19 10:16:07,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 10:16:07,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:07,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:07,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 10:16:07,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:07,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:07,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash -804116766, now seen corresponding path program 1 times [2024-11-19 10:16:07,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:07,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626503512] [2024-11-19 10:16:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:07,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:16:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961067990] [2024-11-19 10:16:07,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:07,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:07,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:07,852 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-11-19 10:16:07,854 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-11-19 10:16:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:07,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:16:07,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:08,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:16:08,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:08,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626503512] [2024-11-19 10:16:08,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:16:08,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961067990] [2024-11-19 10:16:08,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961067990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:08,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:08,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:16:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019566174] [2024-11-19 10:16:08,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:08,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:16:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:08,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:16:08,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:16:08,029 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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-11-19 10:16:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:08,107 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2024-11-19 10:16:08,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:16:08,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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-11-19 10:16:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:08,109 INFO L225 Difference]: With dead ends: 117 [2024-11-19 10:16:08,109 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 10:16:08,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-11-19 10:16:08,111 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:08,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 39 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:08,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 10:16:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2024-11-19 10:16:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.471264367816092) internal successors, (128), 103 states have internal predecessors, (128), 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-11-19 10:16:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2024-11-19 10:16:08,145 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 11 [2024-11-19 10:16:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:08,145 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2024-11-19 10:16:08,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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-11-19 10:16:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2024-11-19 10:16:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 10:16:08,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:08,146 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:08,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 10:16:08,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:08,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:08,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2114272111, now seen corresponding path program 1 times [2024-11-19 10:16:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:08,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399457561] [2024-11-19 10:16:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:16:08,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250242659] [2024-11-19 10:16:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:08,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:08,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:08,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:08,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 10:16:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:08,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:16:08,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:08,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:16:08,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:08,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399457561] [2024-11-19 10:16:08,571 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:16:08,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250242659] [2024-11-19 10:16:08,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250242659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:08,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:08,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:16:08,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046730430] [2024-11-19 10:16:08,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:08,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:16:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:08,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:16:08,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:16:08,573 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-19 10:16:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:08,677 INFO L93 Difference]: Finished difference Result 138 states and 176 transitions. [2024-11-19 10:16:08,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:16:08,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-19 10:16:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:08,678 INFO L225 Difference]: With dead ends: 138 [2024-11-19 10:16:08,678 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 10:16:08,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-11-19 10:16:08,679 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 40 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:08,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 65 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 10:16:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2024-11-19 10:16:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 127 states have internal predecessors, (167), 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-11-19 10:16:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2024-11-19 10:16:08,688 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 167 transitions. Word has length 12 [2024-11-19 10:16:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:08,688 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 167 transitions. [2024-11-19 10:16:08,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-19 10:16:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2024-11-19 10:16:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 10:16:08,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:08,689 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:08,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 10:16:08,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:08,894 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:08,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:08,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1117926046, now seen corresponding path program 1 times [2024-11-19 10:16:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:08,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573001098] [2024-11-19 10:16:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:16:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976534633] [2024-11-19 10:16:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:08,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:08,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:08,917 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:08,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 10:16:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:08,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:16:08,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:09,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:16:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573001098] [2024-11-19 10:16:09,568 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:16:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976534633] [2024-11-19 10:16:09,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976534633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:16:09,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 10:16:09,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-19 10:16:09,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490258308] [2024-11-19 10:16:09,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 10:16:09,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:16:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:09,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:16:09,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:16:09,571 INFO L87 Difference]: Start difference. First operand 128 states and 167 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-11-19 10:16:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:09,932 INFO L93 Difference]: Finished difference Result 281 states and 379 transitions. [2024-11-19 10:16:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:16:09,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 13 [2024-11-19 10:16:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:09,935 INFO L225 Difference]: With dead ends: 281 [2024-11-19 10:16:09,935 INFO L226 Difference]: Without dead ends: 278 [2024-11-19 10:16:09,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:16:09,936 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 105 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:09,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 68 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:16:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-19 10:16:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 205. [2024-11-19 10:16:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 190 states have (on average 1.4578947368421054) internal successors, (277), 204 states have internal predecessors, (277), 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-11-19 10:16:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2024-11-19 10:16:09,958 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 13 [2024-11-19 10:16:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:09,959 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2024-11-19 10:16:09,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-11-19 10:16:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2024-11-19 10:16:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:16:09,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:09,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:09,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 10:16:10,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:10,161 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:10,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:10,161 INFO L85 PathProgramCache]: Analyzing trace with hash 958472918, now seen corresponding path program 1 times [2024-11-19 10:16:10,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007845000] [2024-11-19 10:16:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:10,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007845000] [2024-11-19 10:16:10,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007845000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:16:10,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743792211] [2024-11-19 10:16:10,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:10,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:10,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:10,316 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:10,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 10:16:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:10,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:16:10,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:10,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:16:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:10,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743792211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:16:10,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:16:10,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 10:16:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408572275] [2024-11-19 10:16:10,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:16:10,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:16:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:16:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:16:10,439 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-11-19 10:16:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:10,534 INFO L93 Difference]: Finished difference Result 293 states and 383 transitions. [2024-11-19 10:16:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:16:10,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 16 [2024-11-19 10:16:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:10,538 INFO L225 Difference]: With dead ends: 293 [2024-11-19 10:16:10,538 INFO L226 Difference]: Without dead ends: 291 [2024-11-19 10:16:10,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:16:10,539 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 74 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:10,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 130 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-19 10:16:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 239. [2024-11-19 10:16:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 224 states have (on average 1.4241071428571428) internal successors, (319), 238 states have internal predecessors, (319), 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-11-19 10:16:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 319 transitions. [2024-11-19 10:16:10,562 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 319 transitions. Word has length 16 [2024-11-19 10:16:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:10,562 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 319 transitions. [2024-11-19 10:16:10,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-11-19 10:16:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 319 transitions. [2024-11-19 10:16:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 10:16:10,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:10,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:10,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 10:16:10,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:10,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:10,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash -14939818, now seen corresponding path program 1 times [2024-11-19 10:16:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:10,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730901416] [2024-11-19 10:16:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:10,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730901416] [2024-11-19 10:16:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730901416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:10,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:16:10,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749450647] [2024-11-19 10:16:10,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:10,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:16:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:10,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:16:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:16:10,838 INFO L87 Difference]: Start difference. First operand 239 states and 319 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-11-19 10:16:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:10,875 INFO L93 Difference]: Finished difference Result 239 states and 319 transitions. [2024-11-19 10:16:10,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:16:10,876 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), 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 18 [2024-11-19 10:16:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:10,877 INFO L225 Difference]: With dead ends: 239 [2024-11-19 10:16:10,877 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 10:16:10,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-19 10:16:10,878 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:10,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:16:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 10:16:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-19 10:16:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 224 states have (on average 1.3973214285714286) internal successors, (313), 237 states have internal predecessors, (313), 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-11-19 10:16:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 313 transitions. [2024-11-19 10:16:10,897 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 313 transitions. Word has length 18 [2024-11-19 10:16:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:10,897 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 313 transitions. [2024-11-19 10:16:10,897 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), 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-11-19 10:16:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 313 transitions. [2024-11-19 10:16:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 10:16:10,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:10,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:10,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:16:10,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:10,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash -463134261, now seen corresponding path program 1 times [2024-11-19 10:16:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:10,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124187749] [2024-11-19 10:16:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:11,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:11,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124187749] [2024-11-19 10:16:11,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124187749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:11,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:11,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:16:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633846856] [2024-11-19 10:16:11,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:11,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:16:11,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:16:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:16:11,019 INFO L87 Difference]: Start difference. First operand 238 states and 313 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-11-19 10:16:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:11,147 INFO L93 Difference]: Finished difference Result 271 states and 361 transitions. [2024-11-19 10:16:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:16:11,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-11-19 10:16:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:11,150 INFO L225 Difference]: With dead ends: 271 [2024-11-19 10:16:11,150 INFO L226 Difference]: Without dead ends: 270 [2024-11-19 10:16:11,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:16:11,151 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:11,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 99 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-19 10:16:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 244. [2024-11-19 10:16:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 230 states have (on average 1.3869565217391304) internal successors, (319), 243 states have internal predecessors, (319), 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-11-19 10:16:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 319 transitions. [2024-11-19 10:16:11,166 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 319 transitions. Word has length 19 [2024-11-19 10:16:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:11,166 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 319 transitions. [2024-11-19 10:16:11,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-11-19 10:16:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 319 transitions. [2024-11-19 10:16:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 10:16:11,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:11,168 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-11-19 10:16:11,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:16:11,169 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:11,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1472260104, now seen corresponding path program 1 times [2024-11-19 10:16:11,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:11,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671858708] [2024-11-19 10:16:11,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:11,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:11,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:11,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671858708] [2024-11-19 10:16:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671858708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:11,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:11,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:16:11,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547325787] [2024-11-19 10:16:11,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:11,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:16:11,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:11,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:16:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:16:11,263 INFO L87 Difference]: Start difference. First operand 244 states and 319 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-11-19 10:16:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:11,415 INFO L93 Difference]: Finished difference Result 258 states and 335 transitions. [2024-11-19 10:16:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:16:11,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-11-19 10:16:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:11,417 INFO L225 Difference]: With dead ends: 258 [2024-11-19 10:16:11,417 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 10:16:11,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:16:11,418 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 55 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:11,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 60 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 10:16:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 245. [2024-11-19 10:16:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 231 states have (on average 1.380952380952381) internal successors, (319), 244 states have internal predecessors, (319), 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-11-19 10:16:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 319 transitions. [2024-11-19 10:16:11,434 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 319 transitions. Word has length 20 [2024-11-19 10:16:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:11,434 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 319 transitions. [2024-11-19 10:16:11,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-11-19 10:16:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 319 transitions. [2024-11-19 10:16:11,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:16:11,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:11,435 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] [2024-11-19 10:16:11,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:16:11,435 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:11,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1604577133, now seen corresponding path program 1 times [2024-11-19 10:16:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382961474] [2024-11-19 10:16:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:11,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:11,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382961474] [2024-11-19 10:16:11,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382961474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:11,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:11,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:16:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327076866] [2024-11-19 10:16:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:11,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:16:11,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:11,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:16:11,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:16:11,525 INFO L87 Difference]: Start difference. First operand 245 states and 319 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-11-19 10:16:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:11,641 INFO L93 Difference]: Finished difference Result 258 states and 333 transitions. [2024-11-19 10:16:11,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:16:11,642 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), 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 21 [2024-11-19 10:16:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:11,643 INFO L225 Difference]: With dead ends: 258 [2024-11-19 10:16:11,643 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 10:16:11,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:16:11,645 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:11,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 61 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 10:16:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 246. [2024-11-19 10:16:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 232 states have (on average 1.3793103448275863) internal successors, (320), 245 states have internal predecessors, (320), 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-11-19 10:16:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 320 transitions. [2024-11-19 10:16:11,657 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 320 transitions. Word has length 21 [2024-11-19 10:16:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:11,658 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 320 transitions. [2024-11-19 10:16:11,658 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), 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-11-19 10:16:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 320 transitions. [2024-11-19 10:16:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 10:16:11,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:11,660 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:11,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:16:11,660 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:11,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:11,661 INFO L85 PathProgramCache]: Analyzing trace with hash 105367759, now seen corresponding path program 1 times [2024-11-19 10:16:11,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:11,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29292030] [2024-11-19 10:16:11,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:11,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:16:11,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513756197] [2024-11-19 10:16:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:11,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:11,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:11,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:11,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 10:16:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:11,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:16:11,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:11,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:16:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29292030] [2024-11-19 10:16:11,765 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:16:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513756197] [2024-11-19 10:16:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513756197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:11,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:11,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:16:11,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649109412] [2024-11-19 10:16:11,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:11,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:16:11,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:16:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:16:11,767 INFO L87 Difference]: Start difference. First operand 246 states and 320 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-11-19 10:16:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:11,849 INFO L93 Difference]: Finished difference Result 263 states and 339 transitions. [2024-11-19 10:16:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:16:11,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2024-11-19 10:16:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:11,850 INFO L225 Difference]: With dead ends: 263 [2024-11-19 10:16:11,850 INFO L226 Difference]: Without dead ends: 261 [2024-11-19 10:16:11,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:16:11,851 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 103 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:11,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 33 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-19 10:16:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2024-11-19 10:16:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 246 states have (on average 1.3495934959349594) internal successors, (332), 258 states have internal predecessors, (332), 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-11-19 10:16:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 332 transitions. [2024-11-19 10:16:11,866 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 332 transitions. Word has length 23 [2024-11-19 10:16:11,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:11,866 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 332 transitions. [2024-11-19 10:16:11,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-11-19 10:16:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 332 transitions. [2024-11-19 10:16:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:16:11,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:11,868 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:11,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 10:16:12,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 10:16:12,069 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:12,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:12,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1145239544, now seen corresponding path program 1 times [2024-11-19 10:16:12,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:12,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643745840] [2024-11-19 10:16:12,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:12,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:12,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643745840] [2024-11-19 10:16:12,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643745840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:16:12,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418598525] [2024-11-19 10:16:12,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:12,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:12,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:12,158 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:12,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 10:16:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:12,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:16:12,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 10:16:12,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:16:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418598525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:12,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:16:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-19 10:16:12,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870196655] [2024-11-19 10:16:12,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:12,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:16:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:12,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:16:12,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:16:12,226 INFO L87 Difference]: Start difference. First operand 259 states and 332 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-11-19 10:16:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:12,311 INFO L93 Difference]: Finished difference Result 282 states and 356 transitions. [2024-11-19 10:16:12,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:16:12,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 24 [2024-11-19 10:16:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:12,314 INFO L225 Difference]: With dead ends: 282 [2024-11-19 10:16:12,314 INFO L226 Difference]: Without dead ends: 230 [2024-11-19 10:16:12,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:16:12,315 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:12,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-19 10:16:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2024-11-19 10:16:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 217 states have (on average 1.368663594470046) internal successors, (297), 229 states have internal predecessors, (297), 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-11-19 10:16:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 297 transitions. [2024-11-19 10:16:12,328 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 297 transitions. Word has length 24 [2024-11-19 10:16:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:12,328 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 297 transitions. [2024-11-19 10:16:12,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-11-19 10:16:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 297 transitions. [2024-11-19 10:16:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:16:12,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:12,330 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2024-11-19 10:16:12,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 10:16:12,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 10:16:12,533 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:12,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1212336093, now seen corresponding path program 1 times [2024-11-19 10:16:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:12,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112624392] [2024-11-19 10:16:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:12,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:12,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112624392] [2024-11-19 10:16:12,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112624392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:16:12,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521739604] [2024-11-19 10:16:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:12,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:12,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:12,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:12,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 10:16:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:12,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:16:12,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:12,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:16:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:12,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521739604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:16:12,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:16:12,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 10:16:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497751332] [2024-11-19 10:16:12,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:16:12,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:16:12,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:12,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:16:12,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:16:12,696 INFO L87 Difference]: Start difference. First operand 230 states and 297 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 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-11-19 10:16:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:12,817 INFO L93 Difference]: Finished difference Result 430 states and 549 transitions. [2024-11-19 10:16:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:16:12,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 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 26 [2024-11-19 10:16:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:12,820 INFO L225 Difference]: With dead ends: 430 [2024-11-19 10:16:12,820 INFO L226 Difference]: Without dead ends: 428 [2024-11-19 10:16:12,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:16:12,821 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 180 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:12,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 170 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-19 10:16:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 262. [2024-11-19 10:16:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 249 states have (on average 1.3614457831325302) internal successors, (339), 261 states have internal predecessors, (339), 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-11-19 10:16:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 339 transitions. [2024-11-19 10:16:12,842 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 339 transitions. Word has length 26 [2024-11-19 10:16:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:12,843 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 339 transitions. [2024-11-19 10:16:12,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 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-11-19 10:16:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 339 transitions. [2024-11-19 10:16:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 10:16:12,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:12,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:12,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 10:16:13,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 10:16:13,049 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:13,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:13,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2085952574, now seen corresponding path program 1 times [2024-11-19 10:16:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:13,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121492263] [2024-11-19 10:16:13,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:13,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:13,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121492263] [2024-11-19 10:16:13,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121492263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:16:13,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638867108] [2024-11-19 10:16:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:13,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:13,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:13,133 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:13,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 10:16:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:13,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:16:13,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:16:13,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:16:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638867108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:16:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-19 10:16:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530034385] [2024-11-19 10:16:13,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:13,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:16:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:16:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:16:13,313 INFO L87 Difference]: Start difference. First operand 262 states and 339 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-11-19 10:16:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:13,391 INFO L93 Difference]: Finished difference Result 280 states and 360 transitions. [2024-11-19 10:16:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:16:13,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 29 [2024-11-19 10:16:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:13,393 INFO L225 Difference]: With dead ends: 280 [2024-11-19 10:16:13,393 INFO L226 Difference]: Without dead ends: 278 [2024-11-19 10:16:13,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:16:13,394 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:13,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 36 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-19 10:16:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 274. [2024-11-19 10:16:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 273 states have internal predecessors, (352), 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-11-19 10:16:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 352 transitions. [2024-11-19 10:16:13,415 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 352 transitions. Word has length 29 [2024-11-19 10:16:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:13,415 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 352 transitions. [2024-11-19 10:16:13,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-11-19 10:16:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 352 transitions. [2024-11-19 10:16:13,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 10:16:13,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:13,416 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:13,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 10:16:13,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 10:16:13,617 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:13,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:13,617 INFO L85 PathProgramCache]: Analyzing trace with hash -852418685, now seen corresponding path program 1 times [2024-11-19 10:16:13,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:13,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341350948] [2024-11-19 10:16:13,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:13,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:13,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:13,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341350948] [2024-11-19 10:16:13,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341350948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:16:13,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915971115] [2024-11-19 10:16:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:16:13,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:13,701 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:13,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 10:16:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:16:13,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 10:16:13,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 10:16:13,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:16:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:16:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915971115] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 10:16:13,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 10:16:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 5] total 9 [2024-11-19 10:16:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860857647] [2024-11-19 10:16:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:13,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:16:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:13,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:16:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:16:13,850 INFO L87 Difference]: Start difference. First operand 274 states and 352 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11-19 10:16:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:13,987 INFO L93 Difference]: Finished difference Result 274 states and 352 transitions. [2024-11-19 10:16:13,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:16:13,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 32 [2024-11-19 10:16:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:13,988 INFO L225 Difference]: With dead ends: 274 [2024-11-19 10:16:13,988 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 10:16:13,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:16:13,989 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:13,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 10:16:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-19 10:16:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 60 states have internal predecessors, (65), 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-11-19 10:16:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-11-19 10:16:13,994 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 32 [2024-11-19 10:16:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:13,994 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-11-19 10:16:13,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11-19 10:16:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-11-19 10:16:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 10:16:13,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:13,995 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2024-11-19 10:16:14,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 10:16:14,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 10:16:14,200 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:14,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1118578589, now seen corresponding path program 2 times [2024-11-19 10:16:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:14,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187272769] [2024-11-19 10:16:14,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:16:14,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:14,209 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:16:14,209 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 10:16:14,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26646974] [2024-11-19 10:16:14,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:16:14,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:14,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:14,214 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:14,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 10:16:14,249 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:16:14,249 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:16:14,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 10:16:14,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:14,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:16:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:15,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:15,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187272769] [2024-11-19 10:16:15,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:16:15,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26646974] [2024-11-19 10:16:15,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26646974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:16:15,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 10:16:15,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-19 10:16:15,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703546475] [2024-11-19 10:16:15,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 10:16:15,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 10:16:15,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 10:16:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:16:15,748 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 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-11-19 10:16:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:16,050 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-19 10:16:16,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 10:16:16,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 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 37 [2024-11-19 10:16:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:16,051 INFO L225 Difference]: With dead ends: 95 [2024-11-19 10:16:16,051 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 10:16:16,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:16:16,052 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:16,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 45 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:16:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 10:16:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2024-11-19 10:16:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 87 states have internal predecessors, (96), 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-11-19 10:16:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-11-19 10:16:16,058 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 37 [2024-11-19 10:16:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:16,058 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-11-19 10:16:16,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 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-11-19 10:16:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-11-19 10:16:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 10:16:16,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:16,059 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1] [2024-11-19 10:16:16,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 10:16:16,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:16,263 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:16,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1076455049, now seen corresponding path program 2 times [2024-11-19 10:16:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:16,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251800186] [2024-11-19 10:16:16,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:16:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:16,270 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:16:16,270 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:16:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:16,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:16,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251800186] [2024-11-19 10:16:16,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251800186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:16:16,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135849548] [2024-11-19 10:16:16,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:16:16,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:16,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:16,347 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:16,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 10:16:16,382 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:16:16,382 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:16:16,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:16:16,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:16,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:16:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135849548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:16:16,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:16:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-19 10:16:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154557492] [2024-11-19 10:16:16,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:16:16,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 10:16:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:16,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 10:16:16,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:16:16,525 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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-11-19 10:16:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:16,625 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-11-19 10:16:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 10:16:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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 40 [2024-11-19 10:16:16,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:16,626 INFO L225 Difference]: With dead ends: 95 [2024-11-19 10:16:16,626 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 10:16:16,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:16:16,627 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:16,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 10:16:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-11-19 10:16:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.0681818181818181) internal successors, (94), 90 states have internal predecessors, (94), 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-11-19 10:16:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2024-11-19 10:16:16,633 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 40 [2024-11-19 10:16:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:16,634 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2024-11-19 10:16:16,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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-11-19 10:16:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2024-11-19 10:16:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 10:16:16,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:16,635 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1] [2024-11-19 10:16:16,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-19 10:16:16,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:16,836 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:16,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:16,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1033168561, now seen corresponding path program 2 times [2024-11-19 10:16:16,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:16,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036974863] [2024-11-19 10:16:16,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:16:16,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:16,849 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:16:16,849 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:16:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:16,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:16,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036974863] [2024-11-19 10:16:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036974863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:16:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633957030] [2024-11-19 10:16:16,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:16:16,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:16,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:16,969 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:16,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 10:16:17,007 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:16:17,008 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:16:17,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:16:17,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 10:16:17,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:16:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 10:16:17,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633957030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:16:17,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:16:17,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 13 [2024-11-19 10:16:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692550946] [2024-11-19 10:16:17,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:16:17,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 10:16:17,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:17,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 10:16:17,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:16:17,627 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 14 states, 13 states have (on average 6.461538461538462) internal successors, (84), 14 states have internal predecessors, (84), 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-11-19 10:16:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:17,862 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2024-11-19 10:16:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 10:16:17,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.461538461538462) internal successors, (84), 14 states have internal predecessors, (84), 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 58 [2024-11-19 10:16:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:17,864 INFO L225 Difference]: With dead ends: 91 [2024-11-19 10:16:17,864 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 10:16:17,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2024-11-19 10:16:17,865 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:17,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 16 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:16:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 10:16:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-19 10:16:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 89 states have internal predecessors, (90), 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-11-19 10:16:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2024-11-19 10:16:17,871 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 58 [2024-11-19 10:16:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:17,871 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2024-11-19 10:16:17,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.461538461538462) internal successors, (84), 14 states have internal predecessors, (84), 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-11-19 10:16:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2024-11-19 10:16:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 10:16:17,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:17,873 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2024-11-19 10:16:17,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-19 10:16:18,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:18,078 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:18,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash -937874789, now seen corresponding path program 3 times [2024-11-19 10:16:18,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:18,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504561156] [2024-11-19 10:16:18,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 10:16:18,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:18,094 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 10:16:18,094 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 10:16:18,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335158837] [2024-11-19 10:16:18,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 10:16:18,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:18,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:18,097 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:18,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 10:16:18,140 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 10:16:18,140 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:16:18,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:16:18,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-19 10:16:18,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:16:18,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504561156] [2024-11-19 10:16:18,256 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:16:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335158837] [2024-11-19 10:16:18,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335158837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:16:18,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:16:18,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:16:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198538319] [2024-11-19 10:16:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:16:18,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:16:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:16:18,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:16:18,259 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-19 10:16:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:18,270 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2024-11-19 10:16:18,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:16:18,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 85 [2024-11-19 10:16:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:18,271 INFO L225 Difference]: With dead ends: 90 [2024-11-19 10:16:18,271 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 10:16:18,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 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-11-19 10:16:18,274 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:18,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:16:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 10:16:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 10:16:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 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-11-19 10:16:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2024-11-19 10:16:18,280 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2024-11-19 10:16:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:18,280 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2024-11-19 10:16:18,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-19 10:16:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2024-11-19 10:16:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 10:16:18,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:18,281 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1] [2024-11-19 10:16:18,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-19 10:16:18,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 10:16:18,482 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:18,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1465528903, now seen corresponding path program 3 times [2024-11-19 10:16:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:18,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044285427] [2024-11-19 10:16:18,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 10:16:18,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:18,498 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 10:16:18,498 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:16:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044285427] [2024-11-19 10:16:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044285427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:16:18,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131801041] [2024-11-19 10:16:18,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 10:16:18,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:18,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:18,821 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:18,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 10:16:18,869 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 10:16:18,870 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:16:18,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 10:16:18,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:18,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:16:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:19,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131801041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:16:19,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:16:19,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-19 10:16:19,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166436634] [2024-11-19 10:16:19,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:16:19,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 10:16:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:19,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 10:16:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-19 10:16:19,269 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 24 states, 23 states have (on average 7.608695652173913) internal successors, (175), 24 states have internal predecessors, (175), 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-11-19 10:16:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:19,519 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2024-11-19 10:16:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 10:16:19,520 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.608695652173913) internal successors, (175), 24 states have internal predecessors, (175), 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 88 [2024-11-19 10:16:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:19,521 INFO L225 Difference]: With dead ends: 186 [2024-11-19 10:16:19,521 INFO L226 Difference]: Without dead ends: 185 [2024-11-19 10:16:19,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-19 10:16:19,522 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:19,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:16:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-19 10:16:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-19 10:16:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.0054347826086956) internal successors, (185), 184 states have internal predecessors, (185), 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-11-19 10:16:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2024-11-19 10:16:19,532 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2024-11-19 10:16:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:19,532 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2024-11-19 10:16:19,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.608695652173913) internal successors, (175), 24 states have internal predecessors, (175), 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-11-19 10:16:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2024-11-19 10:16:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 10:16:19,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:19,534 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1] [2024-11-19 10:16:19,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-19 10:16:19,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:19,738 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:19,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1691439677, now seen corresponding path program 4 times [2024-11-19 10:16:19,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:19,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271673956] [2024-11-19 10:16:19,738 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 10:16:19,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:19,760 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 10:16:19,761 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:16:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:20,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:16:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271673956] [2024-11-19 10:16:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271673956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:16:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866071974] [2024-11-19 10:16:20,469 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 10:16:20,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:20,473 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:20,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 10:16:20,544 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 10:16:20,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:16:20,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 10:16:20,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:16:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:20,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:16:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:16:21,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866071974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:16:21,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:16:21,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-11-19 10:16:21,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928601960] [2024-11-19 10:16:21,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:16:21,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-19 10:16:21,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:16:21,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-19 10:16:21,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-19 10:16:21,447 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand has 48 states, 47 states have (on average 7.808510638297872) internal successors, (367), 48 states have internal predecessors, (367), 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-11-19 10:16:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:16:21,663 INFO L93 Difference]: Finished difference Result 250 states and 257 transitions. [2024-11-19 10:16:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 10:16:21,664 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 7.808510638297872) internal successors, (367), 48 states have internal predecessors, (367), 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 184 [2024-11-19 10:16:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:16:21,665 INFO L225 Difference]: With dead ends: 250 [2024-11-19 10:16:21,665 INFO L226 Difference]: Without dead ends: 249 [2024-11-19 10:16:21,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-19 10:16:21,666 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:16:21,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:16:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-19 10:16:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-11-19 10:16:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.0040322580645162) internal successors, (249), 248 states have internal predecessors, (249), 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-11-19 10:16:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2024-11-19 10:16:21,680 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 184 [2024-11-19 10:16:21,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:16:21,681 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2024-11-19 10:16:21,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 7.808510638297872) internal successors, (367), 48 states have internal predecessors, (367), 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-11-19 10:16:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2024-11-19 10:16:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-19 10:16:21,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:16:21,685 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 30, 30, 1, 1, 1] [2024-11-19 10:16:21,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 10:16:21,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:21,886 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:16:21,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:16:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash -407291243, now seen corresponding path program 5 times [2024-11-19 10:16:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:16:21,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330873525] [2024-11-19 10:16:21,887 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 10:16:21,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:16:21,924 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2024-11-19 10:16:21,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 10:16:21,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483043799] [2024-11-19 10:16:21,925 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 10:16:21,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:16:21,929 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:16:21,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 10:16:22,022 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2024-11-19 10:16:22,023 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 10:16:22,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:16:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:16:22,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 10:16:22,103 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:16:22,104 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2024-11-19 10:16:22,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2024-11-19 10:16:22,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2024-11-19 10:16:22,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2024-11-19 10:16:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2024-11-19 10:16:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2024-11-19 10:16:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2024-11-19 10:16:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2024-11-19 10:16:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2024-11-19 10:16:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2024-11-19 10:16:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2024-11-19 10:16:22,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2024-11-19 10:16:22,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2024-11-19 10:16:22,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2024-11-19 10:16:22,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2024-11-19 10:16:22,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2024-11-19 10:16:22,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2024-11-19 10:16:22,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2024-11-19 10:16:22,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-19 10:16:22,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:16:22,312 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:16:22,386 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:16:22,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:16:22 BoogieIcfgContainer [2024-11-19 10:16:22,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:16:22,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:16:22,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:16:22,391 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:16:22,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:16:05" (3/4) ... [2024-11-19 10:16:22,392 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 10:16:22,472 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:16:22,472 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:16:22,472 INFO L158 Benchmark]: Toolchain (without parser) took 18022.93ms. Allocated memory was 146.8MB in the beginning and 274.7MB in the end (delta: 127.9MB). Free memory was 93.9MB in the beginning and 144.2MB in the end (delta: -50.3MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2024-11-19 10:16:22,473 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 146.8MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:16:22,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.49ms. Allocated memory is still 146.8MB. Free memory was 93.5MB in the beginning and 82.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:16:22,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.63ms. Allocated memory is still 146.8MB. Free memory was 82.0MB in the beginning and 80.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:16:22,474 INFO L158 Benchmark]: Boogie Preprocessor took 49.46ms. Allocated memory is still 146.8MB. Free memory was 80.5MB in the beginning and 79.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:16:22,474 INFO L158 Benchmark]: RCFGBuilder took 717.22ms. Allocated memory is still 146.8MB. Free memory was 78.8MB in the beginning and 65.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:16:22,474 INFO L158 Benchmark]: TraceAbstraction took 16650.56ms. Allocated memory was 146.8MB in the beginning and 274.7MB in the end (delta: 127.9MB). Free memory was 65.2MB in the beginning and 152.6MB in the end (delta: -87.3MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2024-11-19 10:16:22,474 INFO L158 Benchmark]: Witness Printer took 81.66ms. Allocated memory is still 274.7MB. Free memory was 152.6MB in the beginning and 144.2MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 10:16:22,476 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 146.8MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.49ms. Allocated memory is still 146.8MB. Free memory was 93.5MB in the beginning and 82.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.63ms. Allocated memory is still 146.8MB. Free memory was 82.0MB in the beginning and 80.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.46ms. Allocated memory is still 146.8MB. Free memory was 80.5MB in the beginning and 79.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 717.22ms. Allocated memory is still 146.8MB. Free memory was 78.8MB in the beginning and 65.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16650.56ms. Allocated memory was 146.8MB in the beginning and 274.7MB in the end (delta: 127.9MB). Free memory was 65.2MB in the beginning and 152.6MB in the end (delta: -87.3MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Witness Printer took 81.66ms. Allocated memory is still 274.7MB. Free memory was 152.6MB in the beginning and 144.2MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. 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: 39]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int A, B; [L24] int r, d, p, q; [L25] A = __VERIFIER_nondet_int() [L26] B = 1 [L28] r = A [L29] d = B [L30] p = 1 [L31] q = 0 VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2, p=1, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4, p=2, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8, p=4, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16, p=8, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=32, p=16, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=64, p=32, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=128, p=64, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=256, p=128, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=512, p=256, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1024, p=512, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2048, p=1024, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4096, p=2048, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8192, p=4096, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16384, p=8192, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=32768, p=16384, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=65536, p=32768, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=131072, p=65536, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=262144, p=131072, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=524288, p=262144, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1048576, p=524288, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2097152, p=1048576, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4194304, p=2097152, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8388608, p=4194304, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16777216, p=8388608, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=33554432, p=16777216, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=67108864, p=33554432, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=134217728, p=67108864, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=268435456, p=134217728, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=536870912, p=268435456, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1073741824, p=536870912, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L39] 2 * d VAL [A=0, B=1, p=1073741824, q=0, r=0] - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: 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: 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. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: 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 1 procedures, 47 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 25, TraceHistogramMax: 31, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 836 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 836 mSDsluCounter, 1589 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1034 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1307 IncrementalHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 555 mSDtfsCounter, 1307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1276 GetRequests, 1101 SyntacticMatches, 3 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=17, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 409 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1989 NumberOfCodeBlocks, 1869 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 1742 ConstructedInterpolants, 92 QuantifiedInterpolants, 6603 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1092 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 42 InterpolantComputations, 16 PerfectInterpolantSequences, 715/8585 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-11-19 10:16:22,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)