./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.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 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:05:43,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:05:43,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:05:43,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:05:43,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:05:43,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:05:43,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:05:43,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:05:43,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:05:43,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:05:43,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:05:43,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:05:43,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:05:43,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:05:43,704 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:05:43,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:05:43,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:05:43,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:05:43,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:05:43,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:05:43,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:05:43,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:05:43,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:05:43,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:05:43,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:05:43,709 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:05:43,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:05:43,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:05:43,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:05:43,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:05:43,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:05:43,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:05:43,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:05:43,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:05:43,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:05:43,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:05:43,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:05:43,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:05:43,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:05:43,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:05:43,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:05:43,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:05:43,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:05:43,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:05:43,714 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 -> 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc [2024-10-14 21:05:43,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:05:43,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:05:43,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:05:43,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:05:43,996 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:05:43,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2024-10-14 21:05:45,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:05:45,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:05:45,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2024-10-14 21:05:45,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9e9f51a/afc054f5faa14780ac16ebfac2201976/FLAG16e19b265 [2024-10-14 21:05:45,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9e9f51a/afc054f5faa14780ac16ebfac2201976 [2024-10-14 21:05:45,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:05:45,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:05:45,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:05:45,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:05:45,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:05:45,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:05:45" (1/1) ... [2024-10-14 21:05:45,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4609a55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:45, skipping insertion in model container [2024-10-14 21:05:45,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:05:45" (1/1) ... [2024-10-14 21:05:45,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:05:46,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:05:46,158 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:05:46,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:05:46,232 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:05:46,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46 WrapperNode [2024-10-14 21:05:46,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:05:46,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:05:46,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:05:46,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:05:46,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,290 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2024-10-14 21:05:46,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:05:46,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:05:46,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:05:46,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:05:46,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,334 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 21:05:46,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:05:46,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:05:46,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:05:46,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:05:46,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (1/1) ... [2024-10-14 21:05:46,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:05:46,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:05:46,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 21:05:46,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 21:05:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:05:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 21:05:46,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 21:05:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:05:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:05:46,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:05:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 21:05:46,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 21:05:46,490 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:05:46,492 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:05:46,945 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-14 21:05:46,945 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:05:46,974 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:05:46,974 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 21:05:46,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:05:46 BoogieIcfgContainer [2024-10-14 21:05:46,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:05:46,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:05:46,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:05:46,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:05:46,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:05:45" (1/3) ... [2024-10-14 21:05:46,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dafe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:05:46, skipping insertion in model container [2024-10-14 21:05:46,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:05:46" (2/3) ... [2024-10-14 21:05:46,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dafe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:05:46, skipping insertion in model container [2024-10-14 21:05:46,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:05:46" (3/3) ... [2024-10-14 21:05:46,983 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound10.c [2024-10-14 21:05:47,001 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:05:47,002 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2024-10-14 21:05:47,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:05:47,062 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;@78afe3f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:05:47,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2024-10-14 21:05:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 95 states have (on average 1.936842105263158) internal successors, (184), 179 states have internal predecessors, (184), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 21:05:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 21:05:47,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:47,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:47,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:47,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1162004414, now seen corresponding path program 1 times [2024-10-14 21:05:47,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:47,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871200168] [2024-10-14 21:05:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:47,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:05:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:05:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:47,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:05:47,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871200168] [2024-10-14 21:05:47,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871200168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:05:47,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:05:47,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:05:47,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925642309] [2024-10-14 21:05:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:05:47,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 21:05:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:05:47,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 21:05:47,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 21:05:47,274 INFO L87 Difference]: Start difference. First operand has 187 states, 95 states have (on average 1.936842105263158) internal successors, (184), 179 states have internal predecessors, (184), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:05:47,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:05:47,322 INFO L93 Difference]: Finished difference Result 359 states and 390 transitions. [2024-10-14 21:05:47,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 21:05:47,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-14 21:05:47,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:05:47,333 INFO L225 Difference]: With dead ends: 359 [2024-10-14 21:05:47,333 INFO L226 Difference]: Without dead ends: 171 [2024-10-14 21:05:47,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 21:05:47,342 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:05:47,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:05:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-14 21:05:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-14 21:05:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 164 states have internal predecessors, (165), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:05:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2024-10-14 21:05:47,397 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 14 [2024-10-14 21:05:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:05:47,399 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2024-10-14 21:05:47,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:05:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2024-10-14 21:05:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 21:05:47,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:47,402 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:47,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:05:47,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:47,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1920324093, now seen corresponding path program 1 times [2024-10-14 21:05:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460905612] [2024-10-14 21:05:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:05:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:05:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:47,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:05:47,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460905612] [2024-10-14 21:05:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460905612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:05:47,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:05:47,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:05:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004120572] [2024-10-14 21:05:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:05:47,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:05:47,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:05:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:05:47,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:05:47,513 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:05:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:05:47,931 INFO L93 Difference]: Finished difference Result 308 states and 320 transitions. [2024-10-14 21:05:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:05:47,932 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-14 21:05:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:05:47,934 INFO L225 Difference]: With dead ends: 308 [2024-10-14 21:05:47,935 INFO L226 Difference]: Without dead ends: 252 [2024-10-14 21:05:47,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:05:47,937 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 21:05:47,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 124 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 21:05:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-14 21:05:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2024-10-14 21:05:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 168 states have (on average 1.505952380952381) internal successors, (253), 238 states have internal predecessors, (253), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 21:05:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 263 transitions. [2024-10-14 21:05:47,953 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 263 transitions. Word has length 14 [2024-10-14 21:05:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:05:47,954 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 263 transitions. [2024-10-14 21:05:47,954 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:05:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 263 transitions. [2024-10-14 21:05:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 21:05:47,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:47,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:47,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:05:47,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:47,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1713492121, now seen corresponding path program 1 times [2024-10-14 21:05:47,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:47,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71747093] [2024-10-14 21:05:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:48,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:05:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:05:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:05:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71747093] [2024-10-14 21:05:48,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71747093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:05:48,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:05:48,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:05:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402455379] [2024-10-14 21:05:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:05:48,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:05:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:05:48,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:05:48,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:05:48,111 INFO L87 Difference]: Start difference. First operand 246 states and 263 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:05:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:05:48,188 INFO L93 Difference]: Finished difference Result 265 states and 277 transitions. [2024-10-14 21:05:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:05:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-10-14 21:05:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:05:48,190 INFO L225 Difference]: With dead ends: 265 [2024-10-14 21:05:48,190 INFO L226 Difference]: Without dead ends: 260 [2024-10-14 21:05:48,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:05:48,192 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:05:48,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 293 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:05:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-14 21:05:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2024-10-14 21:05:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 245 states have internal predecessors, (260), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 21:05:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 270 transitions. [2024-10-14 21:05:48,214 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 270 transitions. Word has length 42 [2024-10-14 21:05:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:05:48,215 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 270 transitions. [2024-10-14 21:05:48,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:05:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 270 transitions. [2024-10-14 21:05:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 21:05:48,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:48,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:48,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 21:05:48,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:48,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1693457243, now seen corresponding path program 1 times [2024-10-14 21:05:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:48,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198675623] [2024-10-14 21:05:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:48,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:48,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:05:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:48,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:05:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:48,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:05:48,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198675623] [2024-10-14 21:05:48,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198675623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:05:48,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:05:48,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:05:48,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599770931] [2024-10-14 21:05:48,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:05:48,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:05:48,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:05:48,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:05:48,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:05:48,358 INFO L87 Difference]: Start difference. First operand 253 states and 270 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:05:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:05:48,555 INFO L93 Difference]: Finished difference Result 264 states and 272 transitions. [2024-10-14 21:05:48,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:05:48,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-14 21:05:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:05:48,557 INFO L225 Difference]: With dead ends: 264 [2024-10-14 21:05:48,561 INFO L226 Difference]: Without dead ends: 259 [2024-10-14 21:05:48,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:05:48,562 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 133 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:05:48,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 230 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:05:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-14 21:05:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2024-10-14 21:05:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.457142857142857) internal successors, (255), 245 states have internal predecessors, (255), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 21:05:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2024-10-14 21:05:48,584 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 44 [2024-10-14 21:05:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:05:48,585 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2024-10-14 21:05:48,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:05:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2024-10-14 21:05:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 21:05:48,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:48,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:48,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 21:05:48,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 957567089, now seen corresponding path program 1 times [2024-10-14 21:05:48,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:48,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624271594] [2024-10-14 21:05:48,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:48,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:48,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:05:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:05:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:48,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:05:48,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624271594] [2024-10-14 21:05:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624271594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:05:48,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:05:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:05:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561500399] [2024-10-14 21:05:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:05:48,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:05:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:05:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:05:48,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:05:48,718 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:05:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:05:49,129 INFO L93 Difference]: Finished difference Result 263 states and 267 transitions. [2024-10-14 21:05:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:05:49,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-10-14 21:05:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:05:49,131 INFO L225 Difference]: With dead ends: 263 [2024-10-14 21:05:49,131 INFO L226 Difference]: Without dead ends: 225 [2024-10-14 21:05:49,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:05:49,132 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 21:05:49,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 264 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 21:05:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-14 21:05:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2024-10-14 21:05:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 211 states have internal predecessors, (217), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 21:05:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 227 transitions. [2024-10-14 21:05:49,148 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 227 transitions. Word has length 45 [2024-10-14 21:05:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:05:49,149 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 227 transitions. [2024-10-14 21:05:49,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:05:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 227 transitions. [2024-10-14 21:05:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 21:05:49,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:49,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:49,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 21:05:49,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:49,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash -280525862, now seen corresponding path program 1 times [2024-10-14 21:05:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594757665] [2024-10-14 21:05:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:49,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:49,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:05:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:49,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:05:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:49,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 21:05:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:49,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:05:49,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594757665] [2024-10-14 21:05:49,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594757665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:05:49,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:05:49,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:05:49,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836797916] [2024-10-14 21:05:49,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:05:49,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:05:49,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:05:49,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:05:49,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:05:49,231 INFO L87 Difference]: Start difference. First operand 219 states and 227 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:05:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:05:49,254 INFO L93 Difference]: Finished difference Result 221 states and 227 transitions. [2024-10-14 21:05:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:05:49,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2024-10-14 21:05:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:05:49,256 INFO L225 Difference]: With dead ends: 221 [2024-10-14 21:05:49,256 INFO L226 Difference]: Without dead ends: 219 [2024-10-14 21:05:49,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:05:49,258 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:05:49,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:05:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-14 21:05:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-14 21:05:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 141 states have (on average 1.524822695035461) internal successors, (215), 211 states have internal predecessors, (215), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 21:05:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 225 transitions. [2024-10-14 21:05:49,274 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 225 transitions. Word has length 54 [2024-10-14 21:05:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:05:49,275 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 225 transitions. [2024-10-14 21:05:49,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:05:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 225 transitions. [2024-10-14 21:05:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 21:05:49,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:49,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:49,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 21:05:49,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:49,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1964749084, now seen corresponding path program 1 times [2024-10-14 21:05:49,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:49,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58396965] [2024-10-14 21:05:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:05:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803699469] [2024-10-14 21:05:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:49,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:05:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:05:49,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:05:49,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 21:05:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:49,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:05:49,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:05:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:49,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:05:49,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:05:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58396965] [2024-10-14 21:05:49,497 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:05:49,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803699469] [2024-10-14 21:05:49,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803699469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:05:49,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:05:49,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:05:49,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829821861] [2024-10-14 21:05:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:05:49,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:05:49,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:05:49,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:05:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:05:49,502 INFO L87 Difference]: Start difference. First operand 219 states and 225 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:05:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:05:49,863 INFO L93 Difference]: Finished difference Result 358 states and 374 transitions. [2024-10-14 21:05:49,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:05:49,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-14 21:05:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:05:49,865 INFO L225 Difference]: With dead ends: 358 [2024-10-14 21:05:49,865 INFO L226 Difference]: Without dead ends: 304 [2024-10-14 21:05:49,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:05:49,866 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 90 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:05:49,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 149 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:05:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-14 21:05:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2024-10-14 21:05:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.4036697247706422) internal successors, (306), 288 states have internal predecessors, (306), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 21:05:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 320 transitions. [2024-10-14 21:05:49,876 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 320 transitions. Word has length 59 [2024-10-14 21:05:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:05:49,876 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 320 transitions. [2024-10-14 21:05:49,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:05:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 320 transitions. [2024-10-14 21:05:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 21:05:49,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:49,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:49,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 21:05:50,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:05:50,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:50,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash -69304982, now seen corresponding path program 1 times [2024-10-14 21:05:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442860394] [2024-10-14 21:05:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:50,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:50,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:05:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:50,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:05:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 21:05:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:05:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442860394] [2024-10-14 21:05:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442860394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:05:50,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:05:50,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:05:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310441206] [2024-10-14 21:05:50,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:05:50,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:05:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:05:50,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:05:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:05:50,236 INFO L87 Difference]: Start difference. First operand 298 states and 320 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:05:54,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:05:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:05:54,487 INFO L93 Difference]: Finished difference Result 299 states and 320 transitions. [2024-10-14 21:05:54,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:05:54,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2024-10-14 21:05:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:05:54,490 INFO L225 Difference]: With dead ends: 299 [2024-10-14 21:05:54,493 INFO L226 Difference]: Without dead ends: 298 [2024-10-14 21:05:54,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:05:54,495 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 39 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:05:54,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 298 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 21:05:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-14 21:05:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-10-14 21:05:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.3990825688073394) internal successors, (305), 288 states have internal predecessors, (305), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 21:05:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 319 transitions. [2024-10-14 21:05:54,508 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 319 transitions. Word has length 65 [2024-10-14 21:05:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:05:54,508 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 319 transitions. [2024-10-14 21:05:54,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:05:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 319 transitions. [2024-10-14 21:05:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 21:05:54,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:54,513 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:54,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 21:05:54,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:54,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1220812152, now seen corresponding path program 1 times [2024-10-14 21:05:54,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:54,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088115898] [2024-10-14 21:05:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:05:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245424897] [2024-10-14 21:05:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:54,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:05:54,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:05:54,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:05:54,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 21:05:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:54,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:05:54,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:05:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 21:05:54,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:05:54,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:05:54,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088115898] [2024-10-14 21:05:54,780 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:05:54,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245424897] [2024-10-14 21:05:54,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245424897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:05:54,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:05:54,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:05:54,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943931668] [2024-10-14 21:05:54,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:05:54,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:05:54,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:05:54,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:05:54,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:05:54,782 INFO L87 Difference]: Start difference. First operand 298 states and 319 transitions. Second operand has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:05:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:05:54,836 INFO L93 Difference]: Finished difference Result 298 states and 319 transitions. [2024-10-14 21:05:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:05:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 95 [2024-10-14 21:05:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:05:54,838 INFO L225 Difference]: With dead ends: 298 [2024-10-14 21:05:54,838 INFO L226 Difference]: Without dead ends: 295 [2024-10-14 21:05:54,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:05:54,839 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:05:54,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 156 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:05:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-14 21:05:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-10-14 21:05:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 218 states have (on average 1.3761467889908257) internal successors, (300), 285 states have internal predecessors, (300), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 21:05:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 314 transitions. [2024-10-14 21:05:54,851 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 314 transitions. Word has length 95 [2024-10-14 21:05:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:05:54,852 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 314 transitions. [2024-10-14 21:05:54,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:05:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 314 transitions. [2024-10-14 21:05:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 21:05:54,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:54,856 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:54,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 21:05:55,057 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,SelfDestructingSolverStorable8 [2024-10-14 21:05:55,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:55,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:55,058 INFO L85 PathProgramCache]: Analyzing trace with hash 809529056, now seen corresponding path program 1 times [2024-10-14 21:05:55,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:55,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268051158] [2024-10-14 21:05:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:55,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:05:55,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600456448] [2024-10-14 21:05:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:55,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:05:55,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:05:55,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:05:55,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 21:05:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:55,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 21:05:55,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:05:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:55,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:05:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:55,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:05:55,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268051158] [2024-10-14 21:05:55,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:05:55,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600456448] [2024-10-14 21:05:55,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600456448] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:05:55,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:05:55,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 21:05:55,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598811200] [2024-10-14 21:05:55,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:05:55,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 21:05:55,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:05:55,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 21:05:55,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:05:55,639 INFO L87 Difference]: Start difference. First operand 295 states and 314 transitions. Second operand has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:05:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:05:56,413 INFO L93 Difference]: Finished difference Result 367 states and 382 transitions. [2024-10-14 21:05:56,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:05:56,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 96 [2024-10-14 21:05:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:05:56,416 INFO L225 Difference]: With dead ends: 367 [2024-10-14 21:05:56,416 INFO L226 Difference]: Without dead ends: 360 [2024-10-14 21:05:56,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:05:56,417 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 284 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 21:05:56,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 300 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 21:05:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-14 21:05:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 333. [2024-10-14 21:05:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 257 states have (on average 1.3968871595330739) internal successors, (359), 323 states have internal predecessors, (359), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 21:05:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 373 transitions. [2024-10-14 21:05:56,430 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 373 transitions. Word has length 96 [2024-10-14 21:05:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:05:56,430 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 373 transitions. [2024-10-14 21:05:56,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:05:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 373 transitions. [2024-10-14 21:05:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 21:05:56,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:05:56,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-10-14 21:05:56,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 21:05:56,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:05:56,637 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:05:56,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:05:56,637 INFO L85 PathProgramCache]: Analyzing trace with hash -674402934, now seen corresponding path program 1 times [2024-10-14 21:05:56,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:05:56,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776005694] [2024-10-14 21:05:56,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:56,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:05:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:05:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275677418] [2024-10-14 21:05:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:05:56,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:05:56,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:05:56,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:05:56,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 21:05:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:05:56,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 21:05:56,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:05:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:05:57,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:06:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:06:02,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:02,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776005694] [2024-10-14 21:06:02,314 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:06:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275677418] [2024-10-14 21:06:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275677418] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 21:06:02,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:06:02,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2024-10-14 21:06:02,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009454158] [2024-10-14 21:06:02,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:06:02,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:06:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:02,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:06:02,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=39, Unknown=1, NotChecked=0, Total=72 [2024-10-14 21:06:02,316 INFO L87 Difference]: Start difference. First operand 333 states and 373 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:06:06,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:10,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:14,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:17,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:21,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:23,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:26,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:30,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:34,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:36,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:39,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:43,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 21:06:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:43,132 INFO L93 Difference]: Finished difference Result 333 states and 373 transitions. [2024-10-14 21:06:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:06:43,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2024-10-14 21:06:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:43,134 INFO L225 Difference]: With dead ends: 333 [2024-10-14 21:06:43,134 INFO L226 Difference]: Without dead ends: 331 [2024-10-14 21:06:43,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=41, Invalid=48, Unknown=1, NotChecked=0, Total=90 [2024-10-14 21:06:43,135 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 147 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.8s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:43,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 66 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 415 Invalid, 7 Unknown, 0 Unchecked, 40.8s Time] [2024-10-14 21:06:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-14 21:06:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2024-10-14 21:06:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 257 states have (on average 1.3813229571984436) internal successors, (355), 321 states have internal predecessors, (355), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 21:06:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 369 transitions. [2024-10-14 21:06:43,164 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 369 transitions. Word has length 97 [2024-10-14 21:06:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:43,164 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 369 transitions. [2024-10-14 21:06:43,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:06:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 369 transitions. [2024-10-14 21:06:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 21:06:43,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:43,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2024-10-14 21:06:43,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 21:06:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:43,370 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash 568345634, now seen corresponding path program 1 times [2024-10-14 21:06:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:43,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533989030] [2024-10-14 21:06:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:06:43,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313637508] [2024-10-14 21:06:43,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:43,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:43,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:43,406 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-10-14 21:06:43,407 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-10-14 21:06:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:43,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:06:43,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:06:43,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:06:43,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:43,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533989030] [2024-10-14 21:06:43,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:06:43,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313637508] [2024-10-14 21:06:43,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313637508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:06:43,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:06:43,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:06:43,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350333499] [2024-10-14 21:06:43,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:06:43,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:06:43,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:43,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:06:43,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:06:43,609 INFO L87 Difference]: Start difference. First operand 331 states and 369 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:06:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:44,124 INFO L93 Difference]: Finished difference Result 331 states and 369 transitions. [2024-10-14 21:06:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:06:44,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 98 [2024-10-14 21:06:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:44,126 INFO L225 Difference]: With dead ends: 331 [2024-10-14 21:06:44,126 INFO L226 Difference]: Without dead ends: 311 [2024-10-14 21:06:44,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:06:44,127 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 114 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:44,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 69 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 21:06:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-14 21:06:44,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-14 21:06:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 257 states have (on average 1.264591439688716) internal successors, (325), 301 states have internal predecessors, (325), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 21:06:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 339 transitions. [2024-10-14 21:06:44,140 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 339 transitions. Word has length 98 [2024-10-14 21:06:44,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:44,140 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 339 transitions. [2024-10-14 21:06:44,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:06:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 339 transitions. [2024-10-14 21:06:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 21:06:44,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:44,141 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-10-14 21:06:44,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 21:06:44,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 21:06:44,342 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:44,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash 438845580, now seen corresponding path program 1 times [2024-10-14 21:06:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:44,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869238163] [2024-10-14 21:06:44,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:44,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:06:44,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443595926] [2024-10-14 21:06:44,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:44,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:44,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:44,364 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-10-14 21:06:44,365 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-10-14 21:06:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:44,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 21:06:44,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:06:44,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:06:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-14 21:06:44,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:44,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869238163] [2024-10-14 21:06:44,951 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:06:44,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443595926] [2024-10-14 21:06:44,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443595926] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 21:06:44,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:06:44,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-14 21:06:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948857548] [2024-10-14 21:06:44,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:06:44,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:06:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:44,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:06:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:06:44,954 INFO L87 Difference]: Start difference. First operand 311 states and 339 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:06:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:46,916 INFO L93 Difference]: Finished difference Result 311 states and 339 transitions. [2024-10-14 21:06:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:06:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 99 [2024-10-14 21:06:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:46,917 INFO L225 Difference]: With dead ends: 311 [2024-10-14 21:06:46,917 INFO L226 Difference]: Without dead ends: 309 [2024-10-14 21:06:46,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:06:46,918 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:46,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 41 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 21:06:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-14 21:06:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-14 21:06:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 299 states have internal predecessors, (321), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 21:06:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 335 transitions. [2024-10-14 21:06:46,943 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 335 transitions. Word has length 99 [2024-10-14 21:06:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:46,943 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 335 transitions. [2024-10-14 21:06:46,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:06:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 335 transitions. [2024-10-14 21:06:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 21:06:46,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:46,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:46,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 21:06:47,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:47,145 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:47,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash -920443063, now seen corresponding path program 1 times [2024-10-14 21:06:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:47,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167943681] [2024-10-14 21:06:47,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:47,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:06:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:06:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 21:06:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 21:06:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:06:47,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:47,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167943681] [2024-10-14 21:06:47,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167943681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:06:47,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893182332] [2024-10-14 21:06:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:47,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:47,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:47,296 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-10-14 21:06:47,298 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-10-14 21:06:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:06:47,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:06:47,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:06:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893182332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:06:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:06:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-14 21:06:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205660343] [2024-10-14 21:06:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:06:47,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:06:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:47,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:06:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:06:47,449 INFO L87 Difference]: Start difference. First operand 309 states and 335 transitions. Second operand has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:06:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:47,475 INFO L93 Difference]: Finished difference Result 309 states and 335 transitions. [2024-10-14 21:06:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:06:47,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 107 [2024-10-14 21:06:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:47,477 INFO L225 Difference]: With dead ends: 309 [2024-10-14 21:06:47,477 INFO L226 Difference]: Without dead ends: 308 [2024-10-14 21:06:47,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:06:47,478 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 25 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:47,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 346 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:06:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-14 21:06:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-14 21:06:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 257 states have (on average 1.2412451361867705) internal successors, (319), 298 states have internal predecessors, (319), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 21:06:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 333 transitions. [2024-10-14 21:06:47,490 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 333 transitions. Word has length 107 [2024-10-14 21:06:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:47,491 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 333 transitions. [2024-10-14 21:06:47,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:06:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 333 transitions. [2024-10-14 21:06:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 21:06:47,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:47,492 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:47,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 21:06:47,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:47,693 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:47,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1531036241, now seen corresponding path program 1 times [2024-10-14 21:06:47,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:47,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059900141] [2024-10-14 21:06:47,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:47,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:06:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:06:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 21:06:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 21:06:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:06:47,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:47,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059900141] [2024-10-14 21:06:47,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059900141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:06:47,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663217968] [2024-10-14 21:06:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:47,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:47,813 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-10-14 21:06:47,816 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-10-14 21:06:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:47,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:06:47,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:06:47,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:06:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:06:48,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663217968] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:06:48,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:06:48,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-14 21:06:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008566235] [2024-10-14 21:06:48,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:06:48,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:06:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:48,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:06:48,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:06:48,103 INFO L87 Difference]: Start difference. First operand 308 states and 333 transitions. Second operand has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 21:06:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:48,150 INFO L93 Difference]: Finished difference Result 407 states and 420 transitions. [2024-10-14 21:06:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:06:48,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 108 [2024-10-14 21:06:48,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:48,153 INFO L225 Difference]: With dead ends: 407 [2024-10-14 21:06:48,153 INFO L226 Difference]: Without dead ends: 406 [2024-10-14 21:06:48,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:06:48,155 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 68 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:48,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 528 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:06:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-14 21:06:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 365. [2024-10-14 21:06:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 312 states have (on average 1.2788461538461537) internal successors, (399), 353 states have internal predecessors, (399), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 21:06:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 417 transitions. [2024-10-14 21:06:48,170 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 417 transitions. Word has length 108 [2024-10-14 21:06:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:48,170 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 417 transitions. [2024-10-14 21:06:48,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 21:06:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 417 transitions. [2024-10-14 21:06:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 21:06:48,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:48,173 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:48,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 21:06:48,377 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,SelfDestructingSolverStorable14 [2024-10-14 21:06:48,378 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:48,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash -423331491, now seen corresponding path program 1 times [2024-10-14 21:06:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639051823] [2024-10-14 21:06:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:48,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:48,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:06:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:48,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:06:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:48,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 21:06:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:48,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 21:06:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 21:06:48,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:48,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639051823] [2024-10-14 21:06:48,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639051823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:06:48,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:06:48,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:06:48,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394799394] [2024-10-14 21:06:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:06:48,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:06:48,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:48,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:06:48,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:06:48,462 INFO L87 Difference]: Start difference. First operand 365 states and 417 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 21:06:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:48,660 INFO L93 Difference]: Finished difference Result 365 states and 417 transitions. [2024-10-14 21:06:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:06:48,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 120 [2024-10-14 21:06:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:48,662 INFO L225 Difference]: With dead ends: 365 [2024-10-14 21:06:48,662 INFO L226 Difference]: Without dead ends: 358 [2024-10-14 21:06:48,662 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-10-14 21:06:48,663 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 128 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:48,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 38 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:06:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-14 21:06:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2024-10-14 21:06:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 312 states have (on average 1.233974358974359) internal successors, (385), 346 states have internal predecessors, (385), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 21:06:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 403 transitions. [2024-10-14 21:06:48,677 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 403 transitions. Word has length 120 [2024-10-14 21:06:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:48,677 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 403 transitions. [2024-10-14 21:06:48,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 21:06:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 403 transitions. [2024-10-14 21:06:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 21:06:48,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:48,679 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:48,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 21:06:48,679 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:48,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash -238374285, now seen corresponding path program 1 times [2024-10-14 21:06:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:48,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37870860] [2024-10-14 21:06:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:48,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:48,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:06:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:48,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:06:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:48,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 21:06:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:48,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 21:06:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 21:06:48,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:48,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37870860] [2024-10-14 21:06:48,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37870860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:06:48,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:06:48,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:06:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547234401] [2024-10-14 21:06:48,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:06:48,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:06:48,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:48,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:06:48,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:06:48,779 INFO L87 Difference]: Start difference. First operand 358 states and 403 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 21:06:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:48,921 INFO L93 Difference]: Finished difference Result 358 states and 403 transitions. [2024-10-14 21:06:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:06:48,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 121 [2024-10-14 21:06:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:48,923 INFO L225 Difference]: With dead ends: 358 [2024-10-14 21:06:48,923 INFO L226 Difference]: Without dead ends: 357 [2024-10-14 21:06:48,923 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-10-14 21:06:48,923 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 108 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:48,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 38 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:06:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-14 21:06:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-10-14 21:06:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 312 states have (on average 1.2243589743589745) internal successors, (382), 345 states have internal predecessors, (382), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 21:06:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 400 transitions. [2024-10-14 21:06:48,938 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 400 transitions. Word has length 121 [2024-10-14 21:06:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:48,938 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 400 transitions. [2024-10-14 21:06:48,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 21:06:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 400 transitions. [2024-10-14 21:06:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 21:06:48,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:48,940 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:48,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 21:06:48,940 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:48,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1444419595, now seen corresponding path program 1 times [2024-10-14 21:06:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562351538] [2024-10-14 21:06:48,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:06:48,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1741090860] [2024-10-14 21:06:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:48,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:48,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:48,970 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-10-14 21:06:48,971 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-10-14 21:06:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:49,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:06:49,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:06:49,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:06:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:06:49,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:49,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562351538] [2024-10-14 21:06:49,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:06:49,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741090860] [2024-10-14 21:06:49,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741090860] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:06:49,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:06:49,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 21:06:49,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672852494] [2024-10-14 21:06:49,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:06:49,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 21:06:49,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:49,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 21:06:49,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:06:49,364 INFO L87 Difference]: Start difference. First operand 357 states and 400 transitions. Second operand has 8 states, 7 states have (on average 30.142857142857142) internal successors, (211), 8 states have internal predecessors, (211), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 21:06:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:49,979 INFO L93 Difference]: Finished difference Result 418 states and 453 transitions. [2024-10-14 21:06:49,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:06:49,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.142857142857142) internal successors, (211), 8 states have internal predecessors, (211), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 123 [2024-10-14 21:06:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:49,981 INFO L225 Difference]: With dead ends: 418 [2024-10-14 21:06:49,981 INFO L226 Difference]: Without dead ends: 388 [2024-10-14 21:06:49,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:06:49,982 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 272 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:49,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 191 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 21:06:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-14 21:06:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 341. [2024-10-14 21:06:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 301 states have (on average 1.1661129568106312) internal successors, (351), 330 states have internal predecessors, (351), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:06:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 367 transitions. [2024-10-14 21:06:49,996 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 367 transitions. Word has length 123 [2024-10-14 21:06:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:49,996 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 367 transitions. [2024-10-14 21:06:49,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.142857142857142) internal successors, (211), 8 states have internal predecessors, (211), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 21:06:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 367 transitions. [2024-10-14 21:06:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-14 21:06:49,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:49,998 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:50,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 21:06:50,198 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,SelfDestructingSolverStorable17 [2024-10-14 21:06:50,199 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:50,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash -351277160, now seen corresponding path program 1 times [2024-10-14 21:06:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:50,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866994313] [2024-10-14 21:06:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:06:50,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080011569] [2024-10-14 21:06:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:50,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:50,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:50,226 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-10-14 21:06:50,228 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-10-14 21:06:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:50,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:06:50,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:06:50,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:06:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:51,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866994313] [2024-10-14 21:06:51,989 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:06:51,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080011569] [2024-10-14 21:06:51,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080011569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:06:51,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:06:51,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-14 21:06:51,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263002072] [2024-10-14 21:06:51,990 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 21:06:51,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:06:51,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:51,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:06:51,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:06:51,991 INFO L87 Difference]: Start difference. First operand 341 states and 367 transitions. Second operand has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 21:06:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:52,260 INFO L93 Difference]: Finished difference Result 379 states and 406 transitions. [2024-10-14 21:06:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:06:52,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 146 [2024-10-14 21:06:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:52,262 INFO L225 Difference]: With dead ends: 379 [2024-10-14 21:06:52,262 INFO L226 Difference]: Without dead ends: 378 [2024-10-14 21:06:52,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:06:52,263 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 22 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:52,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 253 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:06:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-14 21:06:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2024-10-14 21:06:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 336 states have (on average 1.1488095238095237) internal successors, (386), 365 states have internal predecessors, (386), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 21:06:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 404 transitions. [2024-10-14 21:06:52,280 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 404 transitions. Word has length 146 [2024-10-14 21:06:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:52,281 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 404 transitions. [2024-10-14 21:06:52,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 21:06:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 404 transitions. [2024-10-14 21:06:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-14 21:06:52,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:52,282 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:52,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 21:06:52,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:52,483 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:52,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1995310146, now seen corresponding path program 1 times [2024-10-14 21:06:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:52,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503682532] [2024-10-14 21:06:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:06:52,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [618049054] [2024-10-14 21:06:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:52,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:52,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:52,503 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-10-14 21:06:52,506 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-10-14 21:06:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:52,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:06:52,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:06:52,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:06:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503682532] [2024-10-14 21:06:55,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:06:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618049054] [2024-10-14 21:06:55,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618049054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:06:55,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:06:55,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-14 21:06:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434702887] [2024-10-14 21:06:55,417 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 21:06:55,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:06:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:06:55,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:06:55,418 INFO L87 Difference]: Start difference. First operand 377 states and 404 transitions. Second operand has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 21:06:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:55,754 INFO L93 Difference]: Finished difference Result 379 states and 405 transitions. [2024-10-14 21:06:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:06:55,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 147 [2024-10-14 21:06:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:55,756 INFO L225 Difference]: With dead ends: 379 [2024-10-14 21:06:55,756 INFO L226 Difference]: Without dead ends: 341 [2024-10-14 21:06:55,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:06:55,757 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 20 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:55,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 274 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:06:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-14 21:06:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-10-14 21:06:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 301 states have (on average 1.1627906976744187) internal successors, (350), 330 states have internal predecessors, (350), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:06:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 366 transitions. [2024-10-14 21:06:55,770 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 366 transitions. Word has length 147 [2024-10-14 21:06:55,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:55,770 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 366 transitions. [2024-10-14 21:06:55,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 21:06:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 366 transitions. [2024-10-14 21:06:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 21:06:55,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:55,772 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:55,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 21:06:55,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:55,972 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:55,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:55,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1439281792, now seen corresponding path program 1 times [2024-10-14 21:06:55,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:55,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140442952] [2024-10-14 21:06:55,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:55,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:06:56,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694690772] [2024-10-14 21:06:56,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:56,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:56,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:56,005 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-10-14 21:06:56,007 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-10-14 21:06:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:56,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:06:56,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:06:56,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:06:56,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140442952] [2024-10-14 21:06:56,260 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:06:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694690772] [2024-10-14 21:06:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694690772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:06:56,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:06:56,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:06:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442788091] [2024-10-14 21:06:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:06:56,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:06:56,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:06:56,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:06:56,261 INFO L87 Difference]: Start difference. First operand 341 states and 366 transitions. Second operand has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 21:06:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:56,640 INFO L93 Difference]: Finished difference Result 351 states and 378 transitions. [2024-10-14 21:06:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:06:56,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 166 [2024-10-14 21:06:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:56,642 INFO L225 Difference]: With dead ends: 351 [2024-10-14 21:06:56,642 INFO L226 Difference]: Without dead ends: 338 [2024-10-14 21:06:56,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 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-10-14 21:06:56,643 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 155 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:56,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 136 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 21:06:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-14 21:06:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 325. [2024-10-14 21:06:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 298 states have (on average 1.0973154362416107) internal successors, (327), 314 states have internal predecessors, (327), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:06:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 343 transitions. [2024-10-14 21:06:56,655 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 343 transitions. Word has length 166 [2024-10-14 21:06:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:56,656 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 343 transitions. [2024-10-14 21:06:56,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 21:06:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 343 transitions. [2024-10-14 21:06:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-14 21:06:56,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:56,657 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:56,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-14 21:06:56,857 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,SelfDestructingSolverStorable20 [2024-10-14 21:06:56,858 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:56,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1668062458, now seen corresponding path program 1 times [2024-10-14 21:06:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:56,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528599327] [2024-10-14 21:06:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:56,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:06:56,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436068403] [2024-10-14 21:06:56,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:56,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:56,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:56,881 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-10-14 21:06:56,883 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-10-14 21:06:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:56,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:06:56,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:06:57,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:06:57,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:57,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528599327] [2024-10-14 21:06:57,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:06:57,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436068403] [2024-10-14 21:06:57,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436068403] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:06:57,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:06:57,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-10-14 21:06:57,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140718259] [2024-10-14 21:06:57,161 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 21:06:57,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:06:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:57,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:06:57,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:06:57,162 INFO L87 Difference]: Start difference. First operand 325 states and 343 transitions. Second operand has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 21:06:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:57,487 INFO L93 Difference]: Finished difference Result 381 states and 403 transitions. [2024-10-14 21:06:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:06:57,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 167 [2024-10-14 21:06:57,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:57,491 INFO L225 Difference]: With dead ends: 381 [2024-10-14 21:06:57,491 INFO L226 Difference]: Without dead ends: 378 [2024-10-14 21:06:57,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 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-10-14 21:06:57,492 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 117 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:57,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 92 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:06:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-14 21:06:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 325. [2024-10-14 21:06:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 298 states have (on average 1.087248322147651) internal successors, (324), 314 states have internal predecessors, (324), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:06:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 340 transitions. [2024-10-14 21:06:57,506 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 340 transitions. Word has length 167 [2024-10-14 21:06:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:57,507 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 340 transitions. [2024-10-14 21:06:57,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 21:06:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 340 transitions. [2024-10-14 21:06:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 21:06:57,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:57,508 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:57,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 21:06:57,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 21:06:57,709 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:57,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:57,709 INFO L85 PathProgramCache]: Analyzing trace with hash -985216376, now seen corresponding path program 1 times [2024-10-14 21:06:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413077054] [2024-10-14 21:06:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:57,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:06:57,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165156425] [2024-10-14 21:06:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:57,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:57,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:57,746 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-10-14 21:06:57,749 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-10-14 21:06:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:57,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 21:06:57,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:06:57,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:06:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:06:58,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413077054] [2024-10-14 21:06:58,252 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:06:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165156425] [2024-10-14 21:06:58,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165156425] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:06:58,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:06:58,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-14 21:06:58,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727678071] [2024-10-14 21:06:58,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:06:58,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 21:06:58,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:58,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 21:06:58,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:06:58,254 INFO L87 Difference]: Start difference. First operand 325 states and 340 transitions. Second operand has 10 states, 9 states have (on average 32.55555555555556) internal successors, (293), 10 states have internal predecessors, (293), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 21:06:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:06:58,801 INFO L93 Difference]: Finished difference Result 399 states and 422 transitions. [2024-10-14 21:06:58,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:06:58,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 32.55555555555556) internal successors, (293), 10 states have internal predecessors, (293), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 169 [2024-10-14 21:06:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:06:58,803 INFO L225 Difference]: With dead ends: 399 [2024-10-14 21:06:58,803 INFO L226 Difference]: Without dead ends: 388 [2024-10-14 21:06:58,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:06:58,804 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 365 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 21:06:58,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 250 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 21:06:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-14 21:06:58,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 312. [2024-10-14 21:06:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 292 states have (on average 1.047945205479452) internal successors, (306), 301 states have internal predecessors, (306), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:06:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 322 transitions. [2024-10-14 21:06:58,823 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 322 transitions. Word has length 169 [2024-10-14 21:06:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:06:58,823 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 322 transitions. [2024-10-14 21:06:58,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 32.55555555555556) internal successors, (293), 10 states have internal predecessors, (293), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 21:06:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 322 transitions. [2024-10-14 21:06:58,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 21:06:58,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:06:58,826 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:06:58,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-14 21:06:59,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:59,027 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:06:59,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:06:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1900127734, now seen corresponding path program 1 times [2024-10-14 21:06:59,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:06:59,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301881468] [2024-10-14 21:06:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:59,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:06:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:06:59,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120864824] [2024-10-14 21:06:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:06:59,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:06:59,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:06:59,054 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-10-14 21:06:59,055 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-10-14 21:06:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:06:59,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 21:06:59,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:06:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:06:59,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:06:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:06:59,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:06:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301881468] [2024-10-14 21:06:59,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:06:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120864824] [2024-10-14 21:06:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120864824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:06:59,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:06:59,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-14 21:06:59,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588950926] [2024-10-14 21:06:59,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:06:59,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 21:06:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:06:59,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 21:06:59,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-10-14 21:06:59,790 INFO L87 Difference]: Start difference. First operand 312 states and 322 transitions. Second operand has 14 states, 13 states have (on average 22.846153846153847) internal successors, (297), 14 states have internal predecessors, (297), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 21:07:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:07:01,022 INFO L93 Difference]: Finished difference Result 553 states and 589 transitions. [2024-10-14 21:07:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 21:07:01,022 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 22.846153846153847) internal successors, (297), 14 states have internal predecessors, (297), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 171 [2024-10-14 21:07:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:07:01,026 INFO L225 Difference]: With dead ends: 553 [2024-10-14 21:07:01,026 INFO L226 Difference]: Without dead ends: 552 [2024-10-14 21:07:01,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=179, Unknown=0, NotChecked=0, Total=306 [2024-10-14 21:07:01,027 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 463 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:07:01,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 196 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 21:07:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-14 21:07:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 420. [2024-10-14 21:07:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 398 states have (on average 1.0628140703517588) internal successors, (423), 407 states have internal predecessors, (423), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 21:07:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 443 transitions. [2024-10-14 21:07:01,053 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 443 transitions. Word has length 171 [2024-10-14 21:07:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:07:01,054 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 443 transitions. [2024-10-14 21:07:01,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 22.846153846153847) internal successors, (297), 14 states have internal predecessors, (297), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 21:07:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 443 transitions. [2024-10-14 21:07:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 21:07:01,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:07:01,056 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:07:01,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-14 21:07:01,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:07:01,257 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:07:01,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:07:01,257 INFO L85 PathProgramCache]: Analyzing trace with hash 396242567, now seen corresponding path program 2 times [2024-10-14 21:07:01,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:07:01,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072019172] [2024-10-14 21:07:01,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:07:01,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:07:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:07:01,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090340179] [2024-10-14 21:07:01,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:07:01,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:07:01,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:07:01,284 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-10-14 21:07:01,285 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-10-14 21:07:01,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 21:07:01,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:07:01,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:07:01,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:07:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-14 21:07:01,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:07:01,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:07:01,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072019172] [2024-10-14 21:07:01,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:07:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090340179] [2024-10-14 21:07:01,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090340179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:07:01,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:07:01,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:07:01,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624976903] [2024-10-14 21:07:01,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:07:01,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:07:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:07:01,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:07:01,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:07:01,865 INFO L87 Difference]: Start difference. First operand 420 states and 443 transitions. Second operand has 5 states, 4 states have (on average 28.0) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 21:07:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:07:02,010 INFO L93 Difference]: Finished difference Result 420 states and 443 transitions. [2024-10-14 21:07:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:07:02,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 199 [2024-10-14 21:07:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:07:02,012 INFO L225 Difference]: With dead ends: 420 [2024-10-14 21:07:02,012 INFO L226 Difference]: Without dead ends: 361 [2024-10-14 21:07:02,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:07:02,013 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 52 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:07:02,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 45 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:07:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-14 21:07:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-10-14 21:07:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 344 states have (on average 1.0494186046511629) internal successors, (361), 349 states have internal predecessors, (361), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 21:07:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 379 transitions. [2024-10-14 21:07:02,030 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 379 transitions. Word has length 199 [2024-10-14 21:07:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:07:02,031 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 379 transitions. [2024-10-14 21:07:02,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 21:07:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 379 transitions. [2024-10-14 21:07:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-14 21:07:02,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:07:02,032 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:07:02,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-14 21:07:02,232 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,SelfDestructingSolverStorable24 [2024-10-14 21:07:02,233 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-14 21:07:02,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:07:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1769144768, now seen corresponding path program 2 times [2024-10-14 21:07:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:07:02,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037754291] [2024-10-14 21:07:02,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:07:02,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:07:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:07:02,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649570663] [2024-10-14 21:07:02,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:07:02,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:07:02,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:07:02,257 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-10-14 21:07:02,269 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-10-14 21:07:02,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:07:02,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unknown [2024-10-14 21:07:02,355 WARN L124 FreeRefinementEngine]: Strategy CAMEL was unsuccessful and could not determine trace feasibility [2024-10-14 21:07:02,355 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-10-14 21:07:02,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 84 remaining) [2024-10-14 21:07:02,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 84 remaining) [2024-10-14 21:07:02,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 84 remaining) [2024-10-14 21:07:02,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 84 remaining) [2024-10-14 21:07:02,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 84 remaining) [2024-10-14 21:07:02,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 84 remaining) [2024-10-14 21:07:02,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 84 remaining) [2024-10-14 21:07:02,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 84 remaining) [2024-10-14 21:07:02,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 84 remaining) [2024-10-14 21:07:02,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 84 remaining) [2024-10-14 21:07:02,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 84 remaining) [2024-10-14 21:07:02,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 84 remaining) [2024-10-14 21:07:02,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 84 remaining) [2024-10-14 21:07:02,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 84 remaining) [2024-10-14 21:07:02,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 84 remaining) [2024-10-14 21:07:02,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 84 remaining) [2024-10-14 21:07:02,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 84 remaining) [2024-10-14 21:07:02,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 84 remaining) [2024-10-14 21:07:02,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 84 remaining) [2024-10-14 21:07:02,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 84 remaining) [2024-10-14 21:07:02,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 84 remaining) [2024-10-14 21:07:02,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 84 remaining) [2024-10-14 21:07:02,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 84 remaining) [2024-10-14 21:07:02,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 84 remaining) [2024-10-14 21:07:02,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 84 remaining) [2024-10-14 21:07:02,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 84 remaining) [2024-10-14 21:07:02,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 84 remaining) [2024-10-14 21:07:02,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 84 remaining) [2024-10-14 21:07:02,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 84 remaining) [2024-10-14 21:07:02,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 84 remaining) [2024-10-14 21:07:02,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 84 remaining) [2024-10-14 21:07:02,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 84 remaining) [2024-10-14 21:07:02,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 84 remaining) [2024-10-14 21:07:02,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 84 remaining) [2024-10-14 21:07:02,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 84 remaining) [2024-10-14 21:07:02,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 84 remaining) [2024-10-14 21:07:02,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 84 remaining) [2024-10-14 21:07:02,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 84 remaining) [2024-10-14 21:07:02,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 84 remaining) [2024-10-14 21:07:02,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 84 remaining) [2024-10-14 21:07:02,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 84 remaining) [2024-10-14 21:07:02,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 84 remaining) [2024-10-14 21:07:02,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 84 remaining) [2024-10-14 21:07:02,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 84 remaining) [2024-10-14 21:07:02,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 84 remaining) [2024-10-14 21:07:02,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 84 remaining) [2024-10-14 21:07:02,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 84 remaining) [2024-10-14 21:07:02,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 84 remaining) [2024-10-14 21:07:02,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 84 remaining) [2024-10-14 21:07:02,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 84 remaining) [2024-10-14 21:07:02,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 84 remaining) [2024-10-14 21:07:02,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 84 remaining) [2024-10-14 21:07:02,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 84 remaining) [2024-10-14 21:07:02,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 84 remaining) [2024-10-14 21:07:02,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 84 remaining) [2024-10-14 21:07:02,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 84 remaining) [2024-10-14 21:07:02,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 84 remaining) [2024-10-14 21:07:02,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 84 remaining) [2024-10-14 21:07:02,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 84 remaining) [2024-10-14 21:07:02,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 84 remaining) [2024-10-14 21:07:02,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 84 remaining) [2024-10-14 21:07:02,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 84 remaining) [2024-10-14 21:07:02,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 84 remaining) [2024-10-14 21:07:02,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 84 remaining) [2024-10-14 21:07:02,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 84 remaining) [2024-10-14 21:07:02,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 84 remaining) [2024-10-14 21:07:02,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 84 remaining) [2024-10-14 21:07:02,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 84 remaining) [2024-10-14 21:07:02,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 84 remaining) [2024-10-14 21:07:02,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 84 remaining) [2024-10-14 21:07:02,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 84 remaining) [2024-10-14 21:07:02,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 84 remaining) [2024-10-14 21:07:02,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 84 remaining) [2024-10-14 21:07:02,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 84 remaining) [2024-10-14 21:07:02,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 84 remaining) [2024-10-14 21:07:02,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 84 remaining) [2024-10-14 21:07:02,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 84 remaining) [2024-10-14 21:07:02,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 84 remaining) [2024-10-14 21:07:02,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 84 remaining) [2024-10-14 21:07:02,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 84 remaining) [2024-10-14 21:07:02,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 84 remaining) [2024-10-14 21:07:02,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 84 remaining) [2024-10-14 21:07:02,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 84 remaining) [2024-10-14 21:07:02,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 84 remaining) [2024-10-14 21:07:02,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-14 21:07:02,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 21:07:02,583 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:07:02,601 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:07:02,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:07:02 BoogieIcfgContainer [2024-10-14 21:07:02,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:07:02,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:07:02,605 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:07:02,605 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:07:02,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:05:46" (3/4) ... [2024-10-14 21:07:02,607 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 21:07:02,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:07:02,608 INFO L158 Benchmark]: Toolchain (without parser) took 76685.31ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 104.7MB in the beginning and 104.7MB in the end (delta: 2.0kB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-10-14 21:07:02,608 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 96.5MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:07:02,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.01ms. Allocated memory is still 161.5MB. Free memory was 104.2MB in the beginning and 134.6MB in the end (delta: -30.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 21:07:02,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.32ms. Allocated memory is still 161.5MB. Free memory was 134.6MB in the beginning and 132.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:07:02,609 INFO L158 Benchmark]: Boogie Preprocessor took 64.10ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 130.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:07:02,609 INFO L158 Benchmark]: RCFGBuilder took 615.15ms. Allocated memory is still 161.5MB. Free memory was 130.5MB in the beginning and 99.9MB in the end (delta: 30.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-14 21:07:02,610 INFO L158 Benchmark]: TraceAbstraction took 75627.64ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 99.0MB in the beginning and 104.7MB in the end (delta: -5.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-10-14 21:07:02,610 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 195.0MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:07:02,611 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.96ms. Allocated memory is still 96.5MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.01ms. Allocated memory is still 161.5MB. Free memory was 104.2MB in the beginning and 134.6MB in the end (delta: -30.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.32ms. Allocated memory is still 161.5MB. Free memory was 134.6MB in the beginning and 132.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.10ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 130.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 615.15ms. Allocated memory is still 161.5MB. Free memory was 130.5MB in the beginning and 99.9MB in the end (delta: 30.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 75627.64ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 99.0MB in the beginning and 104.7MB in the end (delta: -5.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 195.0MB. Free memory is still 104.7MB. There was no memory consumed. 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 - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L18] short k; [L19] long long y, x, c; [L20] k = __VERIFIER_nondet_short() [L21] CALL assume_abort_if_not(k>=0 && k<=10) [L7] COND FALSE !(!cond) [L21] RET assume_abort_if_not(k>=0 && k<=10) [L22] CALL assume_abort_if_not(k <= 256) [L7] COND FALSE !(!cond) [L22] RET assume_abort_if_not(k <= 256) [L24] y = 0 [L25] x = 0 [L26] c = 0 [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] 30*x - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 187 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 75.5s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 54.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 3032 SdHoareTripleChecker+Valid, 53.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2999 mSDsluCounter, 4886 SdHoareTripleChecker+Invalid, 52.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2789 mSDsCounter, 279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8538 IncrementalHoareTripleChecker+Invalid, 8825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 279 mSolverCounterUnsat, 2097 mSDtfsCounter, 8538 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3194 GetRequests, 3077 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=24, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 421 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 5017 NumberOfCodeBlocks, 4866 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3610 ConstructedInterpolants, 0 QuantifiedInterpolants, 27262 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2710 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 34 InterpolantComputations, 17 PerfectInterpolantSequences, 827/2021 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 could not prove your program: unable to determine feasibility of some traces [2024-10-14 21:07:02,641 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:07:04,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:07:04,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-10-14 21:07:04,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:07:04,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:07:04,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:07:04,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:07:04,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:07:04,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:07:04,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:07:04,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:07:04,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:07:04,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:07:04,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:07:04,778 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:07:04,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:07:04,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:07:04,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:07:04,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:07:04,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:07:04,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:07:04,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:07:04,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:07:04,781 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 21:07:04,781 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 21:07:04,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:07:04,781 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:07:04,782 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 21:07:04,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:07:04,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:07:04,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:07:04,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:07:04,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:07:04,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:07:04,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:07:04,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:07:04,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:07:04,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:07:04,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:07:04,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:07:04,786 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 21:07:04,786 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 21:07:04,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:07:04,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:07:04,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:07:04,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:07:04,787 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 21:07:04,788 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 -> 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc [2024-10-14 21:07:05,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:07:05,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:07:05,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:07:05,116 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:07:05,117 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:07:05,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2024-10-14 21:07:06,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:07:06,781 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:07:06,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2024-10-14 21:07:06,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64ad35fb/0110a26e19c4485daeb92cb7d1b112de/FLAGaab8b8114 [2024-10-14 21:07:06,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64ad35fb/0110a26e19c4485daeb92cb7d1b112de [2024-10-14 21:07:06,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:07:06,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:07:06,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:07:06,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:07:06,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:07:06,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:07:06" (1/1) ... [2024-10-14 21:07:06,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23fe2adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:06, skipping insertion in model container [2024-10-14 21:07:06,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:07:06" (1/1) ... [2024-10-14 21:07:06,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:07:07,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:07:07,021 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:07:07,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:07:07,077 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:07:07,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07 WrapperNode [2024-10-14 21:07:07,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:07:07,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:07:07,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:07:07,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:07:07,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,140 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2024-10-14 21:07:07,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:07:07,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:07:07,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:07:07,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:07:07,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 21:07:07,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:07:07,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:07:07,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:07:07,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:07:07,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:07" (1/1) ... [2024-10-14 21:07:07,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:07:07,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:07:07,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 21:07:07,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 21:07:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:07:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 21:07:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 21:07:07,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 21:07:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:07:07,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:07:07,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 21:07:07,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 21:07:07,394 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:07:07,396 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation