./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-restricted-15/Narrowing.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:16:26,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:16:26,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 20:16:26,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:16:26,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:16:26,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:16:26,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:16:26,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:16:26,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:16:26,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:16:26,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:16:26,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:16:26,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:16:26,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:16:26,458 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:16:26,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:16:26,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:16:26,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:16:26,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:16:26,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:16:26,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:16:26,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:16:26,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:16:26,464 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:16:26,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:16:26,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:16:26,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:16:26,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:16:26,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:16:26,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:16:26,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:16:26,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:16:26,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:16:26,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:16:26,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:16:26,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:16:26,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:16:26,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:16:26,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:16:26,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:16:26,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:16:26,470 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2024-10-14 20:16:26,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:16:26,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:16:26,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:16:26,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:16:26,752 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:16:26,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2024-10-14 20:16:28,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:16:28,327 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:16:28,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2024-10-14 20:16:28,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4e2182d7/ca34ea2dadd7482292dd82e352bfe65c/FLAG4d515c792 [2024-10-14 20:16:28,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4e2182d7/ca34ea2dadd7482292dd82e352bfe65c [2024-10-14 20:16:28,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:16:28,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:16:28,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:16:28,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:16:28,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:16:28,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652c4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28, skipping insertion in model container [2024-10-14 20:16:28,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:16:28,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:16:28,914 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:16:28,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:16:28,940 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:16:28,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28 WrapperNode [2024-10-14 20:16:28,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:16:28,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:16:28,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:16:28,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:16:28,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,965 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2024-10-14 20:16:28,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:16:28,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:16:28,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:16:28,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:16:28,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,982 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 20:16:28,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:16:28,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:16:28,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:16:28,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:16:28,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 20:16:28,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:16:29,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:16:29,031 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 20:16:29,034 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 20:16:29,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:16:29,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:16:29,159 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:16:29,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:16:29,307 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 20:16:29,307 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:16:29,335 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:16:29,336 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:16:29,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:29 BoogieIcfgContainer [2024-10-14 20:16:29,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:16:29,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:16:29,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:16:29,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:16:29,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:16:28" (1/3) ... [2024-10-14 20:16:29,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54234007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:16:29, skipping insertion in model container [2024-10-14 20:16:29,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (2/3) ... [2024-10-14 20:16:29,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54234007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:16:29, skipping insertion in model container [2024-10-14 20:16:29,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:29" (3/3) ... [2024-10-14 20:16:29,350 INFO L112 eAbstractionObserver]: Analyzing ICFG Narrowing.c [2024-10-14 20:16:29,367 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:16:29,367 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-14 20:16:29,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:16:29,445 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;@1b2262c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:16:29,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 20:16:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.9375) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 20:16:29,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:29,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 20:16:29,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:29,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1507284209, now seen corresponding path program 1 times [2024-10-14 20:16:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:29,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807947668] [2024-10-14 20:16:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:29,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:29,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:29,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807947668] [2024-10-14 20:16:29,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807947668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:29,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:29,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:16:29,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962904600] [2024-10-14 20:16:29,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:29,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:29,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:29,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:29,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:29,677 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.9375) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:29,717 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2024-10-14 20:16:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:29,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 20:16:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:29,727 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:16:29,727 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 20:16:29,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:29,734 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:29,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 20:16:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2024-10-14 20:16:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.84) internal successors, (46), 32 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-14 20:16:29,765 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 6 [2024-10-14 20:16:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:29,766 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-14 20:16:29,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-14 20:16:29,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 20:16:29,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:29,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 20:16:29,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:16:29,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:29,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1507341869, now seen corresponding path program 1 times [2024-10-14 20:16:29,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:29,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674670811] [2024-10-14 20:16:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:29,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:29,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:29,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674670811] [2024-10-14 20:16:29,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674670811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:29,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:29,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:16:29,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086181207] [2024-10-14 20:16:29,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:29,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:29,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:29,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:29,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:29,863 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:29,923 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-10-14 20:16:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:29,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 20:16:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:29,925 INFO L225 Difference]: With dead ends: 43 [2024-10-14 20:16:29,926 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 20:16:29,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:16:29,928 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:29,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 20 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:16:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 20:16:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2024-10-14 20:16:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.8) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-14 20:16:29,939 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 6 [2024-10-14 20:16:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:29,940 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-14 20:16:29,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-14 20:16:29,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:16:29,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:29,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:29,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:16:29,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:29,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash 518835859, now seen corresponding path program 1 times [2024-10-14 20:16:29,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:29,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399338681] [2024-10-14 20:16:29,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:29,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399338681] [2024-10-14 20:16:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399338681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:29,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:16:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021662350] [2024-10-14 20:16:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:29,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:29,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:29,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:29,989 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:30,029 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-10-14 20:16:30,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:30,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:16:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:30,031 INFO L225 Difference]: With dead ends: 42 [2024-10-14 20:16:30,031 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 20:16:30,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:30,033 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:30,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 20:16:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2024-10-14 20:16:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.76) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2024-10-14 20:16:30,040 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 7 [2024-10-14 20:16:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:30,040 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2024-10-14 20:16:30,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-10-14 20:16:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:16:30,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:30,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:30,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:16:30,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:30,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash 518836052, now seen corresponding path program 1 times [2024-10-14 20:16:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:30,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786487818] [2024-10-14 20:16:30,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:30,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:30,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786487818] [2024-10-14 20:16:30,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786487818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:30,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:30,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:16:30,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125683777] [2024-10-14 20:16:30,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:30,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:30,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:30,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:30,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:30,077 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:30,105 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2024-10-14 20:16:30,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:30,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:16:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:30,107 INFO L225 Difference]: With dead ends: 65 [2024-10-14 20:16:30,109 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 20:16:30,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:30,111 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:30,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 49 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 20:16:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-10-14 20:16:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.72) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2024-10-14 20:16:30,124 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 7 [2024-10-14 20:16:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:30,124 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2024-10-14 20:16:30,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2024-10-14 20:16:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:16:30,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:30,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:30,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:16:30,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:30,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:30,126 INFO L85 PathProgramCache]: Analyzing trace with hash 517048592, now seen corresponding path program 1 times [2024-10-14 20:16:30,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:30,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906743529] [2024-10-14 20:16:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:30,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:30,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:30,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906743529] [2024-10-14 20:16:30,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906743529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:30,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:30,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:16:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542293913] [2024-10-14 20:16:30,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:30,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:30,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:30,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:30,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:30,175 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:30,201 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2024-10-14 20:16:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:30,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:16:30,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:30,204 INFO L225 Difference]: With dead ends: 65 [2024-10-14 20:16:30,204 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 20:16:30,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:30,206 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:30,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:30,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 20:16:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-10-14 20:16:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.64) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-10-14 20:16:30,215 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 7 [2024-10-14 20:16:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:30,216 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-10-14 20:16:30,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-10-14 20:16:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:16:30,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:30,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:30,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:16:30,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:30,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:30,223 INFO L85 PathProgramCache]: Analyzing trace with hash 517042377, now seen corresponding path program 1 times [2024-10-14 20:16:30,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:30,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987968359] [2024-10-14 20:16:30,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:30,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:30,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:30,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987968359] [2024-10-14 20:16:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987968359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:30,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:30,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:16:30,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337170617] [2024-10-14 20:16:30,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:30,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:30,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:30,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:30,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:30,276 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:30,322 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-10-14 20:16:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:30,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:16:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:30,326 INFO L225 Difference]: With dead ends: 53 [2024-10-14 20:16:30,327 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 20:16:30,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:30,329 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:30,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 45 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 20:16:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-10-14 20:16:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 46 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-10-14 20:16:30,350 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 7 [2024-10-14 20:16:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:30,351 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-10-14 20:16:30,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-10-14 20:16:30,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:16:30,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:30,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:30,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:16:30,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:30,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1095957485, now seen corresponding path program 1 times [2024-10-14 20:16:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302337747] [2024-10-14 20:16:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:30,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:30,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302337747] [2024-10-14 20:16:30,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302337747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:30,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:30,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:16:30,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466118344] [2024-10-14 20:16:30,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:30,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:30,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:30,395 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:30,423 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2024-10-14 20:16:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:16:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:30,424 INFO L225 Difference]: With dead ends: 47 [2024-10-14 20:16:30,424 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 20:16:30,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:16:30,425 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:30,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 12 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 20:16:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2024-10-14 20:16:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-10-14 20:16:30,435 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 8 [2024-10-14 20:16:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:30,435 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-10-14 20:16:30,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-10-14 20:16:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 20:16:30,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:30,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:30,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:16:30,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:30,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:30,438 INFO L85 PathProgramCache]: Analyzing trace with hash 385056408, now seen corresponding path program 1 times [2024-10-14 20:16:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:30,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962718177] [2024-10-14 20:16:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:30,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:30,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962718177] [2024-10-14 20:16:30,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962718177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:30,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:30,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:16:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812354353] [2024-10-14 20:16:30,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:30,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:30,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:30,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:30,493 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:30,556 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2024-10-14 20:16:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:30,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 20:16:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:30,563 INFO L225 Difference]: With dead ends: 65 [2024-10-14 20:16:30,563 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 20:16:30,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:16:30,564 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:30,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:16:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 20:16:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2024-10-14 20:16:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2024-10-14 20:16:30,575 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 9 [2024-10-14 20:16:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:30,576 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-10-14 20:16:30,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2024-10-14 20:16:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:16:30,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:30,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:30,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:16:30,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:30,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash -948153163, now seen corresponding path program 1 times [2024-10-14 20:16:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:30,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706477731] [2024-10-14 20:16:30,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:30,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:30,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:30,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706477731] [2024-10-14 20:16:30,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706477731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:30,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:30,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:16:30,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200538613] [2024-10-14 20:16:30,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:30,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:30,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:30,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:30,625 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:30,654 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2024-10-14 20:16:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:30,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 20:16:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:30,655 INFO L225 Difference]: With dead ends: 60 [2024-10-14 20:16:30,657 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 20:16:30,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:16:30,659 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:30,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 11 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 20:16:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-14 20:16:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 57 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2024-10-14 20:16:30,668 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 10 [2024-10-14 20:16:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:30,669 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2024-10-14 20:16:30,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2024-10-14 20:16:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 20:16:30,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:30,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:30,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:16:30,670 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:30,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash -189534752, now seen corresponding path program 1 times [2024-10-14 20:16:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869014557] [2024-10-14 20:16:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:30,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869014557] [2024-10-14 20:16:30,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869014557] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:16:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895469959] [2024-10-14 20:16:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:30,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:16:30,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:16:30,739 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 20:16:30,741 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 20:16:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:30,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:16:30,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:16:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:30,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:16:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:30,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895469959] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:16:30,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:16:30,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-14 20:16:30,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902566966] [2024-10-14 20:16:30,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:16:30,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:16:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:30,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:16:30,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:16:30,897 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:30,979 INFO L93 Difference]: Finished difference Result 198 states and 252 transitions. [2024-10-14 20:16:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:16:30,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 20:16:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:30,981 INFO L225 Difference]: With dead ends: 198 [2024-10-14 20:16:30,981 INFO L226 Difference]: Without dead ends: 197 [2024-10-14 20:16:30,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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 20:16:30,982 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 83 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:30,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 68 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:16:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-14 20:16:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2024-10-14 20:16:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 126 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 168 transitions. [2024-10-14 20:16:30,995 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 168 transitions. Word has length 17 [2024-10-14 20:16:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:30,995 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 168 transitions. [2024-10-14 20:16:30,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2024-10-14 20:16:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:16:30,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:30,997 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:31,015 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 20:16:31,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 20:16:31,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:31,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:31,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1734509835, now seen corresponding path program 1 times [2024-10-14 20:16:31,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:31,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969454136] [2024-10-14 20:16:31,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:31,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:31,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:31,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969454136] [2024-10-14 20:16:31,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969454136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:16:31,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092875290] [2024-10-14 20:16:31,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:31,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:16:31,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:16:31,250 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 20:16:31,252 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 20:16:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:31,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:16:31,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:16:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:31,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:16:31,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092875290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:31,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:16:31,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [2] total 6 [2024-10-14 20:16:31,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008420504] [2024-10-14 20:16:31,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:31,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:16:31,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:31,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:16:31,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:16:31,332 INFO L87 Difference]: Start difference. First operand 127 states and 168 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:31,433 INFO L93 Difference]: Finished difference Result 323 states and 429 transitions. [2024-10-14 20:16:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:16:31,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 20:16:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:31,435 INFO L225 Difference]: With dead ends: 323 [2024-10-14 20:16:31,436 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 20:16:31,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:16:31,437 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:31,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:16:31,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 20:16:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 233. [2024-10-14 20:16:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 230 states have (on average 1.308695652173913) internal successors, (301), 232 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 301 transitions. [2024-10-14 20:16:31,473 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 301 transitions. Word has length 21 [2024-10-14 20:16:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:31,474 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 301 transitions. [2024-10-14 20:16:31,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 301 transitions. [2024-10-14 20:16:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:16:31,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:31,475 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:31,493 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 20:16:31,675 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,SelfDestructingSolverStorable10 [2024-10-14 20:16:31,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:31,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash 566312755, now seen corresponding path program 1 times [2024-10-14 20:16:31,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:31,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313291640] [2024-10-14 20:16:31,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:31,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:31,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313291640] [2024-10-14 20:16:31,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313291640] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:16:31,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930933074] [2024-10-14 20:16:31,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:31,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:16:31,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:16:31,724 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 20:16:31,725 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 20:16:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:31,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:16:31,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:16:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:31,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:16:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:16:31,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930933074] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:16:31,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:16:31,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-14 20:16:31,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488792094] [2024-10-14 20:16:31,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:16:31,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:16:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:31,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:16:31,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:16:31,862 INFO L87 Difference]: Start difference. First operand 233 states and 301 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:31,922 INFO L93 Difference]: Finished difference Result 362 states and 471 transitions. [2024-10-14 20:16:31,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:16:31,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 20:16:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:31,924 INFO L225 Difference]: With dead ends: 362 [2024-10-14 20:16:31,924 INFO L226 Difference]: Without dead ends: 360 [2024-10-14 20:16:31,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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 20:16:31,925 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 70 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:31,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-14 20:16:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 119. [2024-10-14 20:16:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 118 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2024-10-14 20:16:31,936 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 21 [2024-10-14 20:16:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:31,936 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2024-10-14 20:16:31,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2024-10-14 20:16:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 20:16:31,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:31,938 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2024-10-14 20:16:31,956 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 20:16:32,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:16:32,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:16:32,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1350696795, now seen corresponding path program 2 times [2024-10-14 20:16:32,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:32,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420156920] [2024-10-14 20:16:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-14 20:16:32,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:32,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420156920] [2024-10-14 20:16:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420156920] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:16:32,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069125458] [2024-10-14 20:16:32,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:16:32,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:16:32,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:16:32,234 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 20:16:32,256 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 20:16:32,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 20:16:32,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:16:32,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:16:32,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:16:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-14 20:16:32,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:16:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-14 20:16:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069125458] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:16:32,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:16:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-14 20:16:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815193440] [2024-10-14 20:16:32,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:16:32,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:16:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:16:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:16:32,438 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:32,487 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2024-10-14 20:16:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:16:32,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-14 20:16:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:32,488 INFO L225 Difference]: With dead ends: 124 [2024-10-14 20:16:32,488 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:16:32,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:16:32,489 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:32,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:16:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:16:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:16:32,490 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2024-10-14 20:16:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:32,490 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:16:32,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:16:32,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:16:32,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-14 20:16:32,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-14 20:16:32,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-14 20:16:32,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-14 20:16:32,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-14 20:16:32,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-14 20:16:32,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-14 20:16:32,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-14 20:16:32,515 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 20:16:32,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:16:32,703 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:32,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:16:33,022 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:16:33,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:16:33 BoogieIcfgContainer [2024-10-14 20:16:33,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:16:33,037 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:16:33,037 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:16:33,037 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:16:33,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:29" (3/4) ... [2024-10-14 20:16:33,039 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:16:33,045 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 20:16:33,045 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 20:16:33,046 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 20:16:33,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:16:33,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:16:33,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:16:33,131 INFO L158 Benchmark]: Toolchain (without parser) took 4394.07ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 115.4MB in the beginning and 63.2MB in the end (delta: 52.1MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2024-10-14 20:16:33,131 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:16:33,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.19ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 104.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:16:33,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.85ms. Allocated memory is still 169.9MB. Free memory was 104.9MB in the beginning and 103.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:16:33,132 INFO L158 Benchmark]: Boogie Preprocessor took 24.62ms. Allocated memory is still 169.9MB. Free memory was 103.3MB in the beginning and 102.3MB in the end (delta: 998.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:16:33,132 INFO L158 Benchmark]: RCFGBuilder took 347.47ms. Allocated memory is still 169.9MB. Free memory was 101.8MB in the beginning and 91.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:16:33,132 INFO L158 Benchmark]: TraceAbstraction took 3695.11ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 90.2MB in the beginning and 67.4MB in the end (delta: 22.8MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2024-10-14 20:16:33,132 INFO L158 Benchmark]: Witness Printer took 93.31ms. Allocated memory is still 211.8MB. Free memory was 67.4MB in the beginning and 63.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:16:33,136 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.19ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 104.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.85ms. Allocated memory is still 169.9MB. Free memory was 104.9MB in the beginning and 103.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.62ms. Allocated memory is still 169.9MB. Free memory was 103.3MB in the beginning and 102.3MB in the end (delta: 998.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 347.47ms. Allocated memory is still 169.9MB. Free memory was 101.8MB in the beginning and 91.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3695.11ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 90.2MB in the beginning and 67.4MB in the end (delta: 22.8MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Witness Printer took 93.31ms. Allocated memory is still 211.8MB. Free memory was 67.4MB in the beginning and 63.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 322 IncrementalHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 252 mSDtfsCounter, 322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=11, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 380 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 279 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 344 ConstructedInterpolants, 0 QuantifiedInterpolants, 1020 SizeOfPredicates, 2 NumberOfNonLiveVariables, 136 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 206/310 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((i <= 2147483647) && (0 <= ((long) 2147483646 + range))) && (range <= 20)) && (up == 0)) || (((((up == 1) && (0 <= ((long) 2147483646 + range))) && (range <= 20)) && (i <= 2147483646)) && (0 <= i))) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:16:33,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE