./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/MinusUserDefined.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/MinusUserDefined.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 096bafbba8d51323312e8aef69baa45c66c17c65b2ec8717873d6ff292690721 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:19:04,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:19:04,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:19:04,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:19:04,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:19:04,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:19:04,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:19:04,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:19:04,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:19:04,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:19:04,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:19:04,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:19:04,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:19:04,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:19:04,118 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:19:04,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:19:04,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:19:04,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:19:04,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:19:04,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:19:04,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:19:04,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:19:04,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:19:04,121 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:19:04,121 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:19:04,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:19:04,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:19:04,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:19:04,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:19:04,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:19:04,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:19:04,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:19:04,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:19:04,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:19:04,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:19:04,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:19:04,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:19:04,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:19:04,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:19:04,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:19:04,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:19:04,126 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 096bafbba8d51323312e8aef69baa45c66c17c65b2ec8717873d6ff292690721 [2024-10-11 20:19:04,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:19:04,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:19:04,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:19:04,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:19:04,378 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:19:04,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/MinusUserDefined.c [2024-10-11 20:19:05,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:19:06,005 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:19:06,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/MinusUserDefined.c [2024-10-11 20:19:06,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9ff3c997/1afd6af859f147418a82e854f84ca3df/FLAG7a0a724d9 [2024-10-11 20:19:06,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9ff3c997/1afd6af859f147418a82e854f84ca3df [2024-10-11 20:19:06,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:19:06,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:19:06,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:19:06,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:19:06,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:19:06,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73665ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06, skipping insertion in model container [2024-10-11 20:19:06,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:19:06,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:19:06,595 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:19:06,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:19:06,619 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:19:06,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06 WrapperNode [2024-10-11 20:19:06,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:19:06,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:19:06,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:19:06,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:19:06,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,643 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-10-11 20:19:06,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:19:06,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:19:06,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:19:06,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:19:06,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,663 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 20:19:06,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:19:06,675 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:19:06,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:19:06,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:19:06,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (1/1) ... [2024-10-11 20:19:06,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:19:06,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:06,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:19:06,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:19:06,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:19:06,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:19:06,833 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:19:06,835 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:19:06,961 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 20:19:06,962 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:19:06,980 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:19:06,981 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:19:06,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:19:06 BoogieIcfgContainer [2024-10-11 20:19:06,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:19:06,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:19:06,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:19:06,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:19:06,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:19:06" (1/3) ... [2024-10-11 20:19:06,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6e3f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:19:06, skipping insertion in model container [2024-10-11 20:19:06,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:06" (2/3) ... [2024-10-11 20:19:06,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6e3f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:19:06, skipping insertion in model container [2024-10-11 20:19:06,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:19:06" (3/3) ... [2024-10-11 20:19:06,989 INFO L112 eAbstractionObserver]: Analyzing ICFG MinusUserDefined.c [2024-10-11 20:19:07,007 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:19:07,008 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-11 20:19:07,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:19:07,083 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;@2dc7d175, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:19:07,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 20:19:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:19:07,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:07,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:19:07,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:07,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash 94531, now seen corresponding path program 1 times [2024-10-11 20:19:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:07,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130244651] [2024-10-11 20:19:07,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:07,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:07,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:07,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130244651] [2024-10-11 20:19:07,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130244651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:07,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:07,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:07,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171909185] [2024-10-11 20:19:07,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:07,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:07,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:07,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:07,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:07,304 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:07,358 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-10-11 20:19:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:07,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 20:19:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:07,380 INFO L225 Difference]: With dead ends: 51 [2024-10-11 20:19:07,381 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 20:19:07,386 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-11 20:19:07,389 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:07,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 20:19:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-11 20:19:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.75) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-10-11 20:19:07,429 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 3 [2024-10-11 20:19:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:07,430 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-11 20:19:07,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-10-11 20:19:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:19:07,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:07,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:19:07,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:19:07,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:07,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2929128, now seen corresponding path program 1 times [2024-10-11 20:19:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:07,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382709075] [2024-10-11 20:19:07,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:07,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:07,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382709075] [2024-10-11 20:19:07,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382709075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:07,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:07,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:19:07,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045236927] [2024-10-11 20:19:07,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:07,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:07,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:07,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:07,481 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:07,543 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-11 20:19:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:07,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:19:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:07,544 INFO L225 Difference]: With dead ends: 36 [2024-10-11 20:19:07,545 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 20:19:07,545 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-11 20:19:07,546 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:07,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 17 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 20:19:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-11 20:19:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-10-11 20:19:07,555 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 4 [2024-10-11 20:19:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:07,556 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-11 20:19:07,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-10-11 20:19:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:19:07,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:07,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:19:07,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:19:07,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:07,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:07,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2930506, now seen corresponding path program 1 times [2024-10-11 20:19:07,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:07,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538764535] [2024-10-11 20:19:07,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:07,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:07,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538764535] [2024-10-11 20:19:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538764535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:07,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:07,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:19:07,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419752811] [2024-10-11 20:19:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:07,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:07,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:07,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:07,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:07,612 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:07,633 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-10-11 20:19:07,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:07,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:19:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:07,634 INFO L225 Difference]: With dead ends: 33 [2024-10-11 20:19:07,638 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 20:19:07,639 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-11 20:19:07,640 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:07,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 16 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 20:19:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 20:19:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-11 20:19:07,652 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 4 [2024-10-11 20:19:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:07,653 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-11 20:19:07,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-11 20:19:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:19:07,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:07,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:19:07,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:19:07,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:07,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 90803032, now seen corresponding path program 1 times [2024-10-11 20:19:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113714927] [2024-10-11 20:19:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:07,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:07,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113714927] [2024-10-11 20:19:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113714927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:07,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:07,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:19:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512885432] [2024-10-11 20:19:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:07,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:19:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:07,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:19:07,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:07,743 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:07,806 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-10-11 20:19:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:19:07,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-10-11 20:19:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:07,807 INFO L225 Difference]: With dead ends: 31 [2024-10-11 20:19:07,808 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 20:19:07,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:07,812 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:07,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 20:19:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 20:19:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.565217391304348) internal successors, (36), 29 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-11 20:19:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-10-11 20:19:07,819 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 5 [2024-10-11 20:19:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:07,819 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-11 20:19:07,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-10-11 20:19:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:19:07,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:07,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:19:07,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:19:07,821 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:07,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash 90845733, now seen corresponding path program 1 times [2024-10-11 20:19:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993611340] [2024-10-11 20:19:07,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:07,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:07,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993611340] [2024-10-11 20:19:07,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993611340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:07,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:07,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384414656] [2024-10-11 20:19:07,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:07,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:07,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:07,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:07,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:07,873 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:07,903 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-10-11 20:19:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-11 20:19:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:07,904 INFO L225 Difference]: With dead ends: 30 [2024-10-11 20:19:07,904 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 20:19:07,904 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-11 20:19:07,907 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:07,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 20:19:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 20:19:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-11 20:19:07,915 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 5 [2024-10-11 20:19:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:07,915 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-11 20:19:07,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-11 20:19:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:19:07,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:07,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:19:07,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:19:07,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:07,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1480073238, now seen corresponding path program 1 times [2024-10-11 20:19:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:07,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157077573] [2024-10-11 20:19:07,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:07,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:07,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157077573] [2024-10-11 20:19:07,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157077573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:07,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:07,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:19:07,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606232084] [2024-10-11 20:19:07,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:07,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:07,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:07,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:07,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:07,968 INFO L87 Difference]: Start difference. First operand 28 states and 34 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-11 20:19:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:07,979 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-10-11 20:19:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:07,979 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-11 20:19:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:07,980 INFO L225 Difference]: With dead ends: 28 [2024-10-11 20:19:07,980 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 20:19:07,981 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-11 20:19:07,981 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:07,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 18 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 20:19:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 20:19:07,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.391304347826087) internal successors, (32), 26 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-11 20:19:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-11 20:19:07,987 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 6 [2024-10-11 20:19:07,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:07,988 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-11 20:19:07,988 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-11 20:19:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-11 20:19:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:19:07,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:07,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:19:07,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:19:07,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:07,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1478749524, now seen corresponding path program 1 times [2024-10-11 20:19:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:07,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261237691] [2024-10-11 20:19:07,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:07,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:08,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:08,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261237691] [2024-10-11 20:19:08,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261237691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:08,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:08,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:19:08,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983542026] [2024-10-11 20:19:08,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:08,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:08,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:08,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:08,033 INFO L87 Difference]: Start difference. First operand 27 states and 32 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-11 20:19:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:08,064 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-10-11 20:19:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:08,065 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-11 20:19:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:08,066 INFO L225 Difference]: With dead ends: 27 [2024-10-11 20:19:08,066 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 20:19:08,066 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-11 20:19:08,067 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:08,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 20:19:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-11 20:19:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-11 20:19:08,072 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 6 [2024-10-11 20:19:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:08,073 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-11 20:19:08,073 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-11 20:19:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-10-11 20:19:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:19:08,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:08,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:08,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:19:08,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:08,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1362369946, now seen corresponding path program 1 times [2024-10-11 20:19:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129703132] [2024-10-11 20:19:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129703132] [2024-10-11 20:19:08,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129703132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:08,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:08,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:19:08,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096469065] [2024-10-11 20:19:08,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:08,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:08,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:08,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:08,108 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-11 20:19:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:08,119 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-11 20:19:08,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:08,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-11 20:19:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:08,120 INFO L225 Difference]: With dead ends: 37 [2024-10-11 20:19:08,120 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 20:19:08,121 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-11 20:19:08,121 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:08,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 20:19:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-10-11 20:19:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 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-11 20:19:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-11 20:19:08,128 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2024-10-11 20:19:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:08,129 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-11 20:19:08,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-11 20:19:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-11 20:19:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:19:08,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:08,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:08,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:19:08,130 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:08,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:08,130 INFO L85 PathProgramCache]: Analyzing trace with hash 52524989, now seen corresponding path program 1 times [2024-10-11 20:19:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:08,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358787589] [2024-10-11 20:19:08,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:08,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:08,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:08,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358787589] [2024-10-11 20:19:08,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358787589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:08,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:08,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:19:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030811571] [2024-10-11 20:19:08,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:08,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:19:08,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:08,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:19:08,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:08,181 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11 20:19:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:08,221 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-11 20:19:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:19:08,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11 20:19:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:08,223 INFO L225 Difference]: With dead ends: 40 [2024-10-11 20:19:08,223 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 20:19:08,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:08,224 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:08,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 20:19:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2024-10-11 20:19:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-11 20:19:08,231 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2024-10-11 20:19:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:08,232 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-11 20:19:08,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11 20:19:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-11 20:19:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:19:08,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:08,232 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:19:08,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:19:08,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:08,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:08,237 INFO L85 PathProgramCache]: Analyzing trace with hash 80749167, now seen corresponding path program 1 times [2024-10-11 20:19:08,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:08,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059110077] [2024-10-11 20:19:08,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:08,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059110077] [2024-10-11 20:19:08,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059110077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:08,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416072694] [2024-10-11 20:19:08,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:08,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:08,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:08,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:08,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:19:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:08,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:19:08,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:08,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:08,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416072694] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:08,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:08,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-11 20:19:08,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103073314] [2024-10-11 20:19:08,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:08,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:19:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:08,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:19:08,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:19:08,423 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:08,453 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2024-10-11 20:19:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:19:08,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 20:19:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:08,454 INFO L225 Difference]: With dead ends: 53 [2024-10-11 20:19:08,454 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 20:19:08,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-11 20:19:08,455 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:08,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 52 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 20:19:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 20:19:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-10-11 20:19:08,466 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2024-10-11 20:19:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:08,466 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-10-11 20:19:08,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-10-11 20:19:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 20:19:08,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:08,471 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1] [2024-10-11 20:19:08,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:19:08,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:19:08,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:08,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash 629750382, now seen corresponding path program 2 times [2024-10-11 20:19:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:08,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505348072] [2024-10-11 20:19:08,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:08,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:08,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505348072] [2024-10-11 20:19:08,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505348072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:08,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255026223] [2024-10-11 20:19:08,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:19:08,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:08,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:08,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:08,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:19:08,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:19:08,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:08,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:19:08,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:08,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:09,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255026223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:09,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:09,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 20:19:09,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649179853] [2024-10-11 20:19:09,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:09,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:19:09,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:09,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:19:09,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:19:09,041 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:09,104 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-10-11 20:19:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:19:09,105 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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 31 [2024-10-11 20:19:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:09,106 INFO L225 Difference]: With dead ends: 113 [2024-10-11 20:19:09,106 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 20:19:09,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:19:09,107 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 91 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:09,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 106 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 20:19:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 20:19:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.1081081081081081) internal successors, (123), 111 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2024-10-11 20:19:09,126 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 31 [2024-10-11 20:19:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:09,126 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2024-10-11 20:19:09,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2024-10-11 20:19:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 20:19:09,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:09,128 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1] [2024-10-11 20:19:09,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:19:09,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:09,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:09,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1243138772, now seen corresponding path program 3 times [2024-10-11 20:19:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:09,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614515800] [2024-10-11 20:19:09,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:09,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:09,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614515800] [2024-10-11 20:19:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614515800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504041492] [2024-10-11 20:19:09,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:19:09,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:09,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:09,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:19:09,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 20:19:09,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:09,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:19:09,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:09,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504041492] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:10,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2024-10-11 20:19:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634954062] [2024-10-11 20:19:10,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:10,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 20:19:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 20:19:10,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:19:10,058 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:10,180 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2024-10-11 20:19:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 20:19:10,181 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 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 67 [2024-10-11 20:19:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:10,184 INFO L225 Difference]: With dead ends: 233 [2024-10-11 20:19:10,184 INFO L226 Difference]: Without dead ends: 232 [2024-10-11 20:19:10,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:19:10,185 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 301 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:10,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 214 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:10,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-11 20:19:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-10-11 20:19:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.103896103896104) internal successors, (255), 231 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 255 transitions. [2024-10-11 20:19:10,218 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 255 transitions. Word has length 67 [2024-10-11 20:19:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:10,218 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 255 transitions. [2024-10-11 20:19:10,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 255 transitions. [2024-10-11 20:19:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 20:19:10,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:10,225 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 1, 1, 1] [2024-10-11 20:19:10,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:19:10,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:10,432 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:10,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:10,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1822987688, now seen corresponding path program 4 times [2024-10-11 20:19:10,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:10,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574517967] [2024-10-11 20:19:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 1496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574517967] [2024-10-11 20:19:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574517967] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128017653] [2024-10-11 20:19:11,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 20:19:11,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:11,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:11,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:11,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:19:11,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 20:19:11,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:11,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 20:19:11,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 1496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:11,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 1496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:12,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128017653] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:12,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:12,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2024-10-11 20:19:12,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682299018] [2024-10-11 20:19:12,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:12,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 20:19:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:12,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 20:19:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 20:19:12,349 INFO L87 Difference]: Start difference. First operand 232 states and 255 transitions. Second operand has 48 states, 47 states have (on average 5.914893617021277) internal successors, (278), 47 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:12,655 INFO L93 Difference]: Finished difference Result 473 states and 543 transitions. [2024-10-11 20:19:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-11 20:19:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 5.914893617021277) internal successors, (278), 47 states have internal predecessors, (278), 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 139 [2024-10-11 20:19:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:12,658 INFO L225 Difference]: With dead ends: 473 [2024-10-11 20:19:12,658 INFO L226 Difference]: Without dead ends: 472 [2024-10-11 20:19:12,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 20:19:12,660 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 581 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:12,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 430 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-10-11 20:19:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2024-10-11 20:19:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.1019108280254777) internal successors, (519), 471 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 519 transitions. [2024-10-11 20:19:12,685 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 519 transitions. Word has length 139 [2024-10-11 20:19:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:12,686 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 519 transitions. [2024-10-11 20:19:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.914893617021277) internal successors, (278), 47 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 519 transitions. [2024-10-11 20:19:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-10-11 20:19:12,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:12,692 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 1, 1, 1] [2024-10-11 20:19:12,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:19:12,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:19:12,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash -552402272, now seen corresponding path program 5 times [2024-10-11 20:19:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972341333] [2024-10-11 20:19:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 0 proven. 6440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:15,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:15,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972341333] [2024-10-11 20:19:15,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972341333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:15,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327175614] [2024-10-11 20:19:15,260 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 20:19:15,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:15,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:15,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:15,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:19:15,394 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-10-11 20:19:15,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:15,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 20:19:15,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 0 proven. 6440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:15,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 0 proven. 6440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327175614] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:18,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:18,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2024-10-11 20:19:18,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785116785] [2024-10-11 20:19:18,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:18,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-10-11 20:19:18,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:18,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-10-11 20:19:18,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 20:19:18,339 INFO L87 Difference]: Start difference. First operand 472 states and 519 transitions. Second operand has 96 states, 95 states have (on average 5.957894736842105) internal successors, (566), 95 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:19,794 INFO L93 Difference]: Finished difference Result 953 states and 1095 transitions. [2024-10-11 20:19:19,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-11 20:19:19,795 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 5.957894736842105) internal successors, (566), 95 states have internal predecessors, (566), 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 283 [2024-10-11 20:19:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:19,799 INFO L225 Difference]: With dead ends: 953 [2024-10-11 20:19:19,799 INFO L226 Difference]: Without dead ends: 952 [2024-10-11 20:19:19,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 20:19:19,802 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1901 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:19,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 862 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:19:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-10-11 20:19:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2024-10-11 20:19:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 951 states have (on average 1.1009463722397477) internal successors, (1047), 951 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1047 transitions. [2024-10-11 20:19:19,835 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1047 transitions. Word has length 283 [2024-10-11 20:19:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:19,836 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1047 transitions. [2024-10-11 20:19:19,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 5.957894736842105) internal successors, (566), 95 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1047 transitions. [2024-10-11 20:19:19,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-10-11 20:19:19,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:19,845 INFO L215 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 1, 1, 1] [2024-10-11 20:19:19,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:19:20,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:19:20,047 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:20,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1612090512, now seen corresponding path program 6 times [2024-10-11 20:19:20,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:20,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599828404] [2024-10-11 20:19:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 26696 backedges. 0 proven. 26696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:26,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599828404] [2024-10-11 20:19:26,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599828404] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059655209] [2024-10-11 20:19:26,180 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 20:19:26,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:26,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:26,181 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:26,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:19:26,384 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-10-11 20:19:26,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:26,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-11 20:19:26,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 26696 backedges. 0 proven. 26696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:26,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 26696 backedges. 0 proven. 26696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:36,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059655209] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:36,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:36,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2024-10-11 20:19:36,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395102344] [2024-10-11 20:19:36,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:36,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2024-10-11 20:19:36,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:36,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2024-10-11 20:19:36,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2024-10-11 20:19:36,365 INFO L87 Difference]: Start difference. First operand 952 states and 1047 transitions. Second operand has 192 states, 191 states have (on average 5.979057591623037) internal successors, (1142), 191 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:51,416 INFO L93 Difference]: Finished difference Result 1913 states and 2199 transitions. [2024-10-11 20:19:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2024-10-11 20:19:51,417 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 5.979057591623037) internal successors, (1142), 191 states have internal predecessors, (1142), 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 571 [2024-10-11 20:19:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:51,423 INFO L225 Difference]: With dead ends: 1913 [2024-10-11 20:19:51,424 INFO L226 Difference]: Without dead ends: 1912 [2024-10-11 20:19:51,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1045 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2024-10-11 20:19:51,429 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 4131 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4131 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:51,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4131 Valid, 1726 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:19:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2024-10-11 20:19:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1912. [2024-10-11 20:19:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1911 states have (on average 1.1004709576138147) internal successors, (2103), 1911 states have internal predecessors, (2103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2103 transitions. [2024-10-11 20:19:51,489 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2103 transitions. Word has length 571 [2024-10-11 20:19:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:51,490 INFO L471 AbstractCegarLoop]: Abstraction has 1912 states and 2103 transitions. [2024-10-11 20:19:51,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 5.979057591623037) internal successors, (1142), 191 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2103 transitions. [2024-10-11 20:19:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2024-10-11 20:19:51,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:51,523 INFO L215 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 190, 190, 1, 1, 1] [2024-10-11 20:19:51,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:19:51,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:19:51,724 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 20:19:51,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:51,725 INFO L85 PathProgramCache]: Analyzing trace with hash 928538736, now seen corresponding path program 7 times [2024-10-11 20:19:51,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:51,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113494354] [2024-10-11 20:19:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:51,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 108680 backedges. 0 proven. 108680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:16,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:16,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113494354] [2024-10-11 20:20:16,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113494354] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662911541] [2024-10-11 20:20:16,377 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 20:20:16,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:16,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:16,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:20:16,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:20:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:16,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 1916 conjuncts, 192 conjuncts are in the unsatisfiable core [2024-10-11 20:20:16,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 108680 backedges. 0 proven. 108680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:17,642 INFO L311 TraceCheckSpWp]: Computing backward predicates...