/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:58:06,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:58:06,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:58:06,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:58:06,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:58:06,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:58:06,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:58:06,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:58:06,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:58:06,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:58:06,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:58:06,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:58:06,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:58:06,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:58:06,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:58:06,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:58:06,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:58:06,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:58:06,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:58:06,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:58:06,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:58:06,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:58:06,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:58:06,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:58:06,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:58:06,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:58:06,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:58:06,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:58:06,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:58:06,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:58:06,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:58:06,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:58:06,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:58:06,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:58:06,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:58:06,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:58:06,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:58:06,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:58:06,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:58:06,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:58:06,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:58:06,668 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:58:06,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:58:06,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:58:06,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:58:06,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:58:06,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:58:06,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:58:06,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:58:06,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:58:06,733 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:58:06,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:58:06,735 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:58:06,735 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:58:06,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:58:06,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:58:06,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:58:06,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:58:06,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:58:06,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:58:06,737 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:58:06,737 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:58:06,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:58:06,737 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:58:06,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:58:06,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:58:06,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:58:06,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:58:06,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:58:06,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:58:06,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:58:06,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:58:06,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:58:06,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:58:06,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:58:06,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 21:58:07,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:58:07,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:58:07,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:58:07,209 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:58:07,210 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:58:07,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c [2022-10-15 21:58:07,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1abef4f64/f42c75ec28b442a0b9990f84ac5ada33/FLAG5169d6e89 [2022-10-15 21:58:08,056 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:58:08,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c [2022-10-15 21:58:08,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1abef4f64/f42c75ec28b442a0b9990f84ac5ada33/FLAG5169d6e89 [2022-10-15 21:58:08,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1abef4f64/f42c75ec28b442a0b9990f84ac5ada33 [2022-10-15 21:58:08,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:58:08,339 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:58:08,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:58:08,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:58:08,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:58:08,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:08,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21fe446b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08, skipping insertion in model container [2022-10-15 21:58:08,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:08,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:58:08,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:58:08,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c[26481,26494] [2022-10-15 21:58:08,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:58:08,838 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:58:08,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c[26481,26494] [2022-10-15 21:58:08,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:58:08,945 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:58:08,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08 WrapperNode [2022-10-15 21:58:08,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:58:08,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:58:08,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:58:08,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:58:08,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:08,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:09,028 INFO L138 Inliner]: procedures = 28, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 566 [2022-10-15 21:58:09,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:58:09,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:58:09,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:58:09,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:58:09,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:09,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:09,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:09,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:09,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:09,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:09,085 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:09,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:09,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:58:09,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:58:09,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:58:09,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:58:09,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (1/1) ... [2022-10-15 21:58:09,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:58:09,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:58:09,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 21:58:09,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 21:58:09,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:58:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:58:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:58:09,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:58:09,651 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:58:09,655 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:58:10,697 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:58:10,713 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:58:10,714 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-15 21:58:10,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:58:10 BoogieIcfgContainer [2022-10-15 21:58:10,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:58:10,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:58:10,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:58:10,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:58:10,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:58:08" (1/3) ... [2022-10-15 21:58:10,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f854307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:58:10, skipping insertion in model container [2022-10-15 21:58:10,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:58:08" (2/3) ... [2022-10-15 21:58:10,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f854307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:58:10, skipping insertion in model container [2022-10-15 21:58:10,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:58:10" (3/3) ... [2022-10-15 21:58:10,731 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals.c [2022-10-15 21:58:10,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:58:10,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-10-15 21:58:10,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:58:10,877 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@256b2b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:58:10,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-10-15 21:58:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 190 states have (on average 1.8157894736842106) internal successors, (345), 234 states have internal predecessors, (345), 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) [2022-10-15 21:58:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 21:58:10,912 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:10,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:10,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:10,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2001877049, now seen corresponding path program 1 times [2022-10-15 21:58:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:10,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653417480] [2022-10-15 21:58:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:11,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:11,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653417480] [2022-10-15 21:58:11,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653417480] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:11,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:11,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:58:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214927614] [2022-10-15 21:58:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:11,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-15 21:58:11,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:11,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-15 21:58:11,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 21:58:11,405 INFO L87 Difference]: Start difference. First operand has 235 states, 190 states have (on average 1.8157894736842106) internal successors, (345), 234 states have internal predecessors, (345), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:58:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:11,459 INFO L93 Difference]: Finished difference Result 398 states and 559 transitions. [2022-10-15 21:58:11,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-15 21:58:11,465 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 21:58:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:11,490 INFO L225 Difference]: With dead ends: 398 [2022-10-15 21:58:11,491 INFO L226 Difference]: Without dead ends: 228 [2022-10-15 21:58:11,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 21:58:11,510 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:11,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:58:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-10-15 21:58:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-10-15 21:58:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 186 states have (on average 1.8010752688172043) internal successors, (335), 227 states have internal predecessors, (335), 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) [2022-10-15 21:58:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 335 transitions. [2022-10-15 21:58:11,646 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 335 transitions. Word has length 11 [2022-10-15 21:58:11,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:11,647 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 335 transitions. [2022-10-15 21:58:11,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:58:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 335 transitions. [2022-10-15 21:58:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-15 21:58:11,654 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:11,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:11,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:58:11,656 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:11,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash 28533177, now seen corresponding path program 1 times [2022-10-15 21:58:11,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:11,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289170908] [2022-10-15 21:58:11,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:11,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:12,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:12,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289170908] [2022-10-15 21:58:12,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289170908] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:12,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:12,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:58:12,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294377841] [2022-10-15 21:58:12,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:12,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:58:12,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:12,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:58:12,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:58:12,203 INFO L87 Difference]: Start difference. First operand 228 states and 335 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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) [2022-10-15 21:58:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:12,419 INFO L93 Difference]: Finished difference Result 393 states and 546 transitions. [2022-10-15 21:58:12,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:58:12,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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) Word has length 41 [2022-10-15 21:58:12,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:12,423 INFO L225 Difference]: With dead ends: 393 [2022-10-15 21:58:12,423 INFO L226 Difference]: Without dead ends: 228 [2022-10-15 21:58:12,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:58:12,429 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 3 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:12,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1268 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:58:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-10-15 21:58:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-10-15 21:58:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 186 states have (on average 1.4731182795698925) internal successors, (274), 227 states have internal predecessors, (274), 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) [2022-10-15 21:58:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 274 transitions. [2022-10-15 21:58:12,460 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 274 transitions. Word has length 41 [2022-10-15 21:58:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:12,461 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 274 transitions. [2022-10-15 21:58:12,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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) [2022-10-15 21:58:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 274 transitions. [2022-10-15 21:58:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 21:58:12,467 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:12,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:12,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:58:12,468 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:12,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash 14663593, now seen corresponding path program 1 times [2022-10-15 21:58:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:12,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111695762] [2022-10-15 21:58:12,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:12,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:12,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111695762] [2022-10-15 21:58:12,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111695762] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:12,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:12,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:58:12,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047631733] [2022-10-15 21:58:12,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:12,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:58:12,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:58:12,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:12,781 INFO L87 Difference]: Start difference. First operand 228 states and 274 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:12,831 INFO L93 Difference]: Finished difference Result 544 states and 678 transitions. [2022-10-15 21:58:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:58:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2022-10-15 21:58:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:12,835 INFO L225 Difference]: With dead ends: 544 [2022-10-15 21:58:12,835 INFO L226 Difference]: Without dead ends: 383 [2022-10-15 21:58:12,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:12,839 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 193 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:12,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 659 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:58:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-10-15 21:58:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 341. [2022-10-15 21:58:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 299 states have (on average 1.5719063545150502) internal successors, (470), 340 states have internal predecessors, (470), 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) [2022-10-15 21:58:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 470 transitions. [2022-10-15 21:58:12,860 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 470 transitions. Word has length 101 [2022-10-15 21:58:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:12,861 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 470 transitions. [2022-10-15 21:58:12,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 470 transitions. [2022-10-15 21:58:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 21:58:12,864 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:12,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:12,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:58:12,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:12,865 INFO L85 PathProgramCache]: Analyzing trace with hash -726768609, now seen corresponding path program 1 times [2022-10-15 21:58:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:12,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137009624] [2022-10-15 21:58:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:12,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:13,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:13,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137009624] [2022-10-15 21:58:13,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137009624] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:13,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:13,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:58:13,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903248452] [2022-10-15 21:58:13,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:13,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:58:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:13,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:58:13,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:13,126 INFO L87 Difference]: Start difference. First operand 341 states and 470 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:13,184 INFO L93 Difference]: Finished difference Result 877 states and 1256 transitions. [2022-10-15 21:58:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:58:13,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2022-10-15 21:58:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:13,190 INFO L225 Difference]: With dead ends: 877 [2022-10-15 21:58:13,190 INFO L226 Difference]: Without dead ends: 603 [2022-10-15 21:58:13,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:13,194 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 189 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:13,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 658 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:58:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-10-15 21:58:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 561. [2022-10-15 21:58:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 519 states have (on average 1.6396917148362236) internal successors, (851), 560 states have internal predecessors, (851), 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) [2022-10-15 21:58:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 851 transitions. [2022-10-15 21:58:13,230 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 851 transitions. Word has length 101 [2022-10-15 21:58:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:13,231 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 851 transitions. [2022-10-15 21:58:13,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 851 transitions. [2022-10-15 21:58:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 21:58:13,234 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:13,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:13,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:58:13,235 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:13,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1472351339, now seen corresponding path program 1 times [2022-10-15 21:58:13,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:13,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251364998] [2022-10-15 21:58:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:13,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:13,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251364998] [2022-10-15 21:58:13,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251364998] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:13,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:13,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:58:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526767165] [2022-10-15 21:58:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:13,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:58:13,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:13,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:58:13,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:13,517 INFO L87 Difference]: Start difference. First operand 561 states and 851 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:13,598 INFO L93 Difference]: Finished difference Result 1525 states and 2379 transitions. [2022-10-15 21:58:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:58:13,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2022-10-15 21:58:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:13,613 INFO L225 Difference]: With dead ends: 1525 [2022-10-15 21:58:13,613 INFO L226 Difference]: Without dead ends: 1031 [2022-10-15 21:58:13,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:13,623 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 185 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:13,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 657 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:58:13,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-10-15 21:58:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 989. [2022-10-15 21:58:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 947 states have (on average 1.6800422386483633) internal successors, (1591), 988 states have internal predecessors, (1591), 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) [2022-10-15 21:58:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1591 transitions. [2022-10-15 21:58:13,702 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1591 transitions. Word has length 101 [2022-10-15 21:58:13,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:13,703 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1591 transitions. [2022-10-15 21:58:13,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1591 transitions. [2022-10-15 21:58:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 21:58:13,715 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:13,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:13,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:58:13,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash 882585099, now seen corresponding path program 1 times [2022-10-15 21:58:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:13,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271357282] [2022-10-15 21:58:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:13,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:13,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271357282] [2022-10-15 21:58:13,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271357282] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:13,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:13,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:58:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458272423] [2022-10-15 21:58:13,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:13,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:58:13,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:58:13,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:13,915 INFO L87 Difference]: Start difference. First operand 989 states and 1591 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:14,025 INFO L93 Difference]: Finished difference Result 2785 states and 4559 transitions. [2022-10-15 21:58:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:58:14,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2022-10-15 21:58:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:14,038 INFO L225 Difference]: With dead ends: 2785 [2022-10-15 21:58:14,038 INFO L226 Difference]: Without dead ends: 1863 [2022-10-15 21:58:14,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:14,042 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 181 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:14,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 656 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:58:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2022-10-15 21:58:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1821. [2022-10-15 21:58:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1779 states have (on average 1.7015177065767284) internal successors, (3027), 1820 states have internal predecessors, (3027), 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) [2022-10-15 21:58:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 3027 transitions. [2022-10-15 21:58:14,139 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 3027 transitions. Word has length 101 [2022-10-15 21:58:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:14,139 INFO L495 AbstractCegarLoop]: Abstraction has 1821 states and 3027 transitions. [2022-10-15 21:58:14,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 3027 transitions. [2022-10-15 21:58:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 21:58:14,141 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:14,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:14,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:58:14,142 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:14,143 INFO L85 PathProgramCache]: Analyzing trace with hash -711699583, now seen corresponding path program 1 times [2022-10-15 21:58:14,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:14,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211734012] [2022-10-15 21:58:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:14,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:14,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211734012] [2022-10-15 21:58:14,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211734012] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:14,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:14,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:58:14,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472678901] [2022-10-15 21:58:14,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:14,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:58:14,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:14,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:58:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:14,272 INFO L87 Difference]: Start difference. First operand 1821 states and 3027 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:14,437 INFO L93 Difference]: Finished difference Result 5233 states and 8787 transitions. [2022-10-15 21:58:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:58:14,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2022-10-15 21:58:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:14,460 INFO L225 Difference]: With dead ends: 5233 [2022-10-15 21:58:14,461 INFO L226 Difference]: Without dead ends: 3479 [2022-10-15 21:58:14,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:14,467 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 177 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:14,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 655 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:58:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2022-10-15 21:58:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3437. [2022-10-15 21:58:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 3395 states have (on average 1.7116347569955817) internal successors, (5811), 3436 states have internal predecessors, (5811), 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) [2022-10-15 21:58:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 5811 transitions. [2022-10-15 21:58:14,716 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 5811 transitions. Word has length 101 [2022-10-15 21:58:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:14,717 INFO L495 AbstractCegarLoop]: Abstraction has 3437 states and 5811 transitions. [2022-10-15 21:58:14,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 5811 transitions. [2022-10-15 21:58:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 21:58:14,719 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:14,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:14,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:58:14,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash -373906441, now seen corresponding path program 1 times [2022-10-15 21:58:14,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:14,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670566840] [2022-10-15 21:58:14,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:14,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:14,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670566840] [2022-10-15 21:58:14,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670566840] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:14,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:14,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:58:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636922024] [2022-10-15 21:58:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:14,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:58:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:58:14,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:14,951 INFO L87 Difference]: Start difference. First operand 3437 states and 5811 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:15,312 INFO L93 Difference]: Finished difference Result 9985 states and 16979 transitions. [2022-10-15 21:58:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:58:15,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2022-10-15 21:58:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:15,350 INFO L225 Difference]: With dead ends: 9985 [2022-10-15 21:58:15,351 INFO L226 Difference]: Without dead ends: 6615 [2022-10-15 21:58:15,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:15,360 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 173 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:15,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 654 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:58:15,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6615 states. [2022-10-15 21:58:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6615 to 6573. [2022-10-15 21:58:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6573 states, 6531 states have (on average 1.7153575256469147) internal successors, (11203), 6572 states have internal predecessors, (11203), 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) [2022-10-15 21:58:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6573 states to 6573 states and 11203 transitions. [2022-10-15 21:58:15,841 INFO L78 Accepts]: Start accepts. Automaton has 6573 states and 11203 transitions. Word has length 101 [2022-10-15 21:58:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:15,842 INFO L495 AbstractCegarLoop]: Abstraction has 6573 states and 11203 transitions. [2022-10-15 21:58:15,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 6573 states and 11203 transitions. [2022-10-15 21:58:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 21:58:15,847 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:15,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:15,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:58:15,854 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:15,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:15,855 INFO L85 PathProgramCache]: Analyzing trace with hash 844078957, now seen corresponding path program 1 times [2022-10-15 21:58:15,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:15,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645622876] [2022-10-15 21:58:15,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:15,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:16,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645622876] [2022-10-15 21:58:16,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645622876] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:16,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:16,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:58:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289706154] [2022-10-15 21:58:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:16,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:58:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:16,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:58:16,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:16,006 INFO L87 Difference]: Start difference. First operand 6573 states and 11203 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:16,593 INFO L93 Difference]: Finished difference Result 19201 states and 32835 transitions. [2022-10-15 21:58:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:58:16,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2022-10-15 21:58:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:16,693 INFO L225 Difference]: With dead ends: 19201 [2022-10-15 21:58:16,693 INFO L226 Difference]: Without dead ends: 12695 [2022-10-15 21:58:16,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:16,712 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 169 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:16,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 653 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:58:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12695 states. [2022-10-15 21:58:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12695 to 12653. [2022-10-15 21:58:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12653 states, 12611 states have (on average 1.7155657759099199) internal successors, (21635), 12652 states have internal predecessors, (21635), 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) [2022-10-15 21:58:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12653 states to 12653 states and 21635 transitions. [2022-10-15 21:58:17,617 INFO L78 Accepts]: Start accepts. Automaton has 12653 states and 21635 transitions. Word has length 101 [2022-10-15 21:58:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:17,618 INFO L495 AbstractCegarLoop]: Abstraction has 12653 states and 21635 transitions. [2022-10-15 21:58:17,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-10-15 21:58:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 12653 states and 21635 transitions. [2022-10-15 21:58:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 21:58:17,621 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:17,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:17,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:58:17,622 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:17,623 INFO L85 PathProgramCache]: Analyzing trace with hash 862826145, now seen corresponding path program 1 times [2022-10-15 21:58:17,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:17,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415525455] [2022-10-15 21:58:17,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:17,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:17,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:17,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415525455] [2022-10-15 21:58:17,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415525455] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:17,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:17,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:58:17,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656463023] [2022-10-15 21:58:17,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:17,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:58:17,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:17,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:58:17,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:58:17,827 INFO L87 Difference]: Start difference. First operand 12653 states and 21635 transitions. Second operand has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 4 states have internal predecessors, (101), 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) [2022-10-15 21:58:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:19,708 INFO L93 Difference]: Finished difference Result 37822 states and 64771 transitions. [2022-10-15 21:58:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:58:19,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 4 states have internal predecessors, (101), 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 101 [2022-10-15 21:58:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:19,904 INFO L225 Difference]: With dead ends: 37822 [2022-10-15 21:58:19,905 INFO L226 Difference]: Without dead ends: 37819 [2022-10-15 21:58:19,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:58:19,924 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 637 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:19,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 491 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:58:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37819 states. [2022-10-15 21:58:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37819 to 25197. [2022-10-15 21:58:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25197 states, 25155 states have (on average 1.702206320810972) internal successors, (42819), 25196 states have internal predecessors, (42819), 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) [2022-10-15 21:58:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25197 states to 25197 states and 42819 transitions. [2022-10-15 21:58:22,100 INFO L78 Accepts]: Start accepts. Automaton has 25197 states and 42819 transitions. Word has length 101 [2022-10-15 21:58:22,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:22,101 INFO L495 AbstractCegarLoop]: Abstraction has 25197 states and 42819 transitions. [2022-10-15 21:58:22,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 4 states have internal predecessors, (101), 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) [2022-10-15 21:58:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25197 states and 42819 transitions. [2022-10-15 21:58:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-10-15 21:58:22,103 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:22,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:22,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 21:58:22,104 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 977807414, now seen corresponding path program 1 times [2022-10-15 21:58:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:22,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520469884] [2022-10-15 21:58:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:22,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520469884] [2022-10-15 21:58:22,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520469884] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:22,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:22,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:58:22,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427198348] [2022-10-15 21:58:22,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:22,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:58:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:22,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:58:22,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:58:22,317 INFO L87 Difference]: Start difference. First operand 25197 states and 42819 transitions. Second operand has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 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) [2022-10-15 21:58:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:24,045 INFO L93 Difference]: Finished difference Result 37780 states and 64387 transitions. [2022-10-15 21:58:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:58:24,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 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 102 [2022-10-15 21:58:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:24,143 INFO L225 Difference]: With dead ends: 37780 [2022-10-15 21:58:24,143 INFO L226 Difference]: Without dead ends: 37777 [2022-10-15 21:58:24,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:58:24,158 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 630 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:24,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 306 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:58:24,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37777 states. [2022-10-15 21:58:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37777 to 37741. [2022-10-15 21:58:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37741 states, 37699 states have (on average 1.6875513939361786) internal successors, (63619), 37740 states have internal predecessors, (63619), 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) [2022-10-15 21:58:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37741 states to 37741 states and 63619 transitions. [2022-10-15 21:58:26,893 INFO L78 Accepts]: Start accepts. Automaton has 37741 states and 63619 transitions. Word has length 102 [2022-10-15 21:58:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:26,894 INFO L495 AbstractCegarLoop]: Abstraction has 37741 states and 63619 transitions. [2022-10-15 21:58:26,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 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) [2022-10-15 21:58:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 37741 states and 63619 transitions. [2022-10-15 21:58:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-15 21:58:26,895 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:26,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:26,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 21:58:26,896 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash 247259459, now seen corresponding path program 1 times [2022-10-15 21:58:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:26,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515325018] [2022-10-15 21:58:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:27,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:27,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515325018] [2022-10-15 21:58:27,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515325018] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:27,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:27,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:58:27,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861687467] [2022-10-15 21:58:27,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:27,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:58:27,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:27,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:58:27,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:58:27,199 INFO L87 Difference]: Start difference. First operand 37741 states and 63619 transitions. Second operand has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 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) [2022-10-15 21:58:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:29,508 INFO L93 Difference]: Finished difference Result 62937 states and 105603 transitions. [2022-10-15 21:58:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:58:29,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 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 103 [2022-10-15 21:58:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:29,629 INFO L225 Difference]: With dead ends: 62937 [2022-10-15 21:58:29,630 INFO L226 Difference]: Without dead ends: 62934 [2022-10-15 21:58:29,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:58:29,654 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 1256 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:29,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 697 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:58:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62934 states. [2022-10-15 21:58:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62934 to 50285. [2022-10-15 21:58:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50285 states, 50243 states have (on average 1.6725713034651593) internal successors, (84035), 50284 states have internal predecessors, (84035), 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) [2022-10-15 21:58:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50285 states to 50285 states and 84035 transitions. [2022-10-15 21:58:32,150 INFO L78 Accepts]: Start accepts. Automaton has 50285 states and 84035 transitions. Word has length 103 [2022-10-15 21:58:32,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:32,151 INFO L495 AbstractCegarLoop]: Abstraction has 50285 states and 84035 transitions. [2022-10-15 21:58:32,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 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) [2022-10-15 21:58:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 50285 states and 84035 transitions. [2022-10-15 21:58:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-10-15 21:58:32,153 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:32,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:32,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 21:58:32,155 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash -924890664, now seen corresponding path program 1 times [2022-10-15 21:58:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:32,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224975329] [2022-10-15 21:58:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:32,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:32,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224975329] [2022-10-15 21:58:32,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224975329] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:32,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:32,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:58:32,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896129936] [2022-10-15 21:58:32,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:32,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:58:32,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:32,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:58:32,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:58:32,672 INFO L87 Difference]: Start difference. First operand 50285 states and 84035 transitions. Second operand has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 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) [2022-10-15 21:58:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:34,937 INFO L93 Difference]: Finished difference Result 62901 states and 105219 transitions. [2022-10-15 21:58:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:58:34,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 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 104 [2022-10-15 21:58:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:35,072 INFO L225 Difference]: With dead ends: 62901 [2022-10-15 21:58:35,072 INFO L226 Difference]: Without dead ends: 62898 [2022-10-15 21:58:35,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:58:35,100 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 1117 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:35,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 494 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:58:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62898 states. [2022-10-15 21:58:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62898 to 62829. [2022-10-15 21:58:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62829 states, 62787 states have (on average 1.6574609393664295) internal successors, (104067), 62828 states have internal predecessors, (104067), 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) [2022-10-15 21:58:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62829 states to 62829 states and 104067 transitions. [2022-10-15 21:58:38,199 INFO L78 Accepts]: Start accepts. Automaton has 62829 states and 104067 transitions. Word has length 104 [2022-10-15 21:58:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:38,199 INFO L495 AbstractCegarLoop]: Abstraction has 62829 states and 104067 transitions. [2022-10-15 21:58:38,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 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) [2022-10-15 21:58:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 62829 states and 104067 transitions. [2022-10-15 21:58:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-10-15 21:58:38,201 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:38,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:38,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 21:58:38,202 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:38,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1393161189, now seen corresponding path program 1 times [2022-10-15 21:58:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:38,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001724375] [2022-10-15 21:58:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:38,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001724375] [2022-10-15 21:58:38,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001724375] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:38,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:38,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:58:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60840500] [2022-10-15 21:58:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:38,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:58:38,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:38,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:58:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:58:38,442 INFO L87 Difference]: Start difference. First operand 62829 states and 104067 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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) [2022-10-15 21:58:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:42,735 INFO L93 Difference]: Finished difference Result 100590 states and 166083 transitions. [2022-10-15 21:58:42,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 21:58:42,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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 105 [2022-10-15 21:58:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:42,937 INFO L225 Difference]: With dead ends: 100590 [2022-10-15 21:58:42,937 INFO L226 Difference]: Without dead ends: 100587 [2022-10-15 21:58:42,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:58:42,961 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 2009 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:42,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2009 Valid, 917 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:58:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100587 states. [2022-10-15 21:58:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100587 to 75373. [2022-10-15 21:58:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75373 states, 75331 states have (on average 1.6422853805206357) internal successors, (123715), 75372 states have internal predecessors, (123715), 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) [2022-10-15 21:58:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75373 states to 75373 states and 123715 transitions. [2022-10-15 21:58:46,402 INFO L78 Accepts]: Start accepts. Automaton has 75373 states and 123715 transitions. Word has length 105 [2022-10-15 21:58:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:46,403 INFO L495 AbstractCegarLoop]: Abstraction has 75373 states and 123715 transitions. [2022-10-15 21:58:46,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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) [2022-10-15 21:58:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 75373 states and 123715 transitions. [2022-10-15 21:58:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-15 21:58:46,404 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:46,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:46,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 21:58:46,404 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash 238324602, now seen corresponding path program 1 times [2022-10-15 21:58:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:46,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065247304] [2022-10-15 21:58:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:46,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065247304] [2022-10-15 21:58:46,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065247304] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:46,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:46,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:58:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364538459] [2022-10-15 21:58:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:46,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:58:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:46,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:58:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:58:46,889 INFO L87 Difference]: Start difference. First operand 75373 states and 123715 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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) [2022-10-15 21:58:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:58:50,960 INFO L93 Difference]: Finished difference Result 100563 states and 164931 transitions. [2022-10-15 21:58:50,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:58:50,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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 106 [2022-10-15 21:58:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:58:51,121 INFO L225 Difference]: With dead ends: 100563 [2022-10-15 21:58:51,121 INFO L226 Difference]: Without dead ends: 100560 [2022-10-15 21:58:51,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:58:51,142 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 1758 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1758 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:58:51,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1758 Valid, 696 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:58:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100560 states. [2022-10-15 21:58:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100560 to 100461. [2022-10-15 21:58:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100461 states, 100419 states have (on average 1.6271323155976458) internal successors, (163395), 100460 states have internal predecessors, (163395), 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) [2022-10-15 21:58:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100461 states to 100461 states and 163395 transitions. [2022-10-15 21:58:55,954 INFO L78 Accepts]: Start accepts. Automaton has 100461 states and 163395 transitions. Word has length 106 [2022-10-15 21:58:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:58:55,954 INFO L495 AbstractCegarLoop]: Abstraction has 100461 states and 163395 transitions. [2022-10-15 21:58:55,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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) [2022-10-15 21:58:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 100461 states and 163395 transitions. [2022-10-15 21:58:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-15 21:58:55,956 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:58:55,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:58:55,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 21:58:55,956 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2022-10-15 21:58:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:58:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash -586395056, now seen corresponding path program 1 times [2022-10-15 21:58:55,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:58:55,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035575582] [2022-10-15 21:58:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:58:55,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:58:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:58:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:58:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:58:56,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035575582] [2022-10-15 21:58:56,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035575582] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:58:56,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:58:56,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:58:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989177490] [2022-10-15 21:58:56,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:58:56,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:58:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:58:56,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:58:56,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:58:56,108 INFO L87 Difference]: Start difference. First operand 100461 states and 163395 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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)