/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/loops/eureka_01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 14:36:33,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 14:36:33,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 14:36:33,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 14:36:33,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 14:36:33,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 14:36:33,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 14:36:33,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 14:36:33,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 14:36:33,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 14:36:33,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 14:36:33,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 14:36:33,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 14:36:33,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 14:36:33,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 14:36:33,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 14:36:33,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 14:36:33,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 14:36:33,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 14:36:33,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 14:36:33,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 14:36:33,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 14:36:33,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 14:36:33,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 14:36:33,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 14:36:33,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 14:36:33,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 14:36:33,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 14:36:33,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 14:36:33,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 14:36:33,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 14:36:33,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 14:36:33,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 14:36:33,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 14:36:33,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 14:36:33,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 14:36:33,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 14:36:33,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 14:36:33,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 14:36:33,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 14:36:33,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 14:36:33,530 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-16 14:36:33,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 14:36:33,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 14:36:33,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 14:36:33,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 14:36:33,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 14:36:33,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 14:36:33,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 14:36:33,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 14:36:33,574 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 14:36:33,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 14:36:33,575 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 14:36:33,575 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 14:36:33,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 14:36:33,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 14:36:33,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 14:36:33,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 14:36:33,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 14:36:33,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 14:36:33,579 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 14:36:33,579 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 14:36:33,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 14:36:33,579 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 14:36:33,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 14:36:33,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 14:36:33,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 14:36:33,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 14:36:33,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:36:33,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 14:36:33,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 14:36:33,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 14:36:33,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 14:36:33,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 14:36:33,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 14:36:33,583 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-16 14:36:33,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 14:36:33,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 14:36:33,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 14:36:34,000 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 14:36:34,001 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 14:36:34,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_01-2.c [2022-10-16 14:36:34,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613607c74/2bcc1713b0824ac4aafaa17adedbb510/FLAG6eea31948 [2022-10-16 14:36:34,708 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 14:36:34,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-2.c [2022-10-16 14:36:34,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613607c74/2bcc1713b0824ac4aafaa17adedbb510/FLAG6eea31948 [2022-10-16 14:36:34,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613607c74/2bcc1713b0824ac4aafaa17adedbb510 [2022-10-16 14:36:34,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 14:36:34,740 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 14:36:34,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 14:36:34,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 14:36:34,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 14:36:34,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:36:34" (1/1) ... [2022-10-16 14:36:34,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a3b93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:34, skipping insertion in model container [2022-10-16 14:36:34,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:36:34" (1/1) ... [2022-10-16 14:36:34,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 14:36:34,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 14:36:34,926 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/loops/eureka_01-2.c[323,336] [2022-10-16 14:36:34,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:36:34,969 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 14:36:34,987 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/loops/eureka_01-2.c[323,336] [2022-10-16 14:36:35,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:36:35,028 INFO L208 MainTranslator]: Completed translation [2022-10-16 14:36:35,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35 WrapperNode [2022-10-16 14:36:35,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 14:36:35,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 14:36:35,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 14:36:35,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 14:36:35,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,104 INFO L138 Inliner]: procedures = 13, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 215 [2022-10-16 14:36:35,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 14:36:35,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 14:36:35,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 14:36:35,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 14:36:35,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,143 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 14:36:35,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 14:36:35,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 14:36:35,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 14:36:35,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (1/1) ... [2022-10-16 14:36:35,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:36:35,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:36:35,196 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-16 14:36:35,203 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-16 14:36:35,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 14:36:35,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 14:36:35,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 14:36:35,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 14:36:35,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 14:36:35,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 14:36:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 14:36:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 14:36:35,336 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 14:36:35,338 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 14:36:35,788 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 14:36:35,796 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 14:36:35,796 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-16 14:36:35,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:36:35 BoogieIcfgContainer [2022-10-16 14:36:35,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 14:36:35,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 14:36:35,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 14:36:35,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 14:36:35,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:36:34" (1/3) ... [2022-10-16 14:36:35,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fb3c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:36:35, skipping insertion in model container [2022-10-16 14:36:35,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:36:35" (2/3) ... [2022-10-16 14:36:35,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fb3c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:36:35, skipping insertion in model container [2022-10-16 14:36:35,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:36:35" (3/3) ... [2022-10-16 14:36:35,809 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2022-10-16 14:36:35,833 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 14:36:35,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-16 14:36:35,894 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 14:36:35,903 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;@2731dcf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 14:36:35,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-16 14:36:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 40 states have (on average 1.75) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 14:36:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 14:36:35,917 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:36:35,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 14:36:35,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:36:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:36:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash 889661671, now seen corresponding path program 1 times [2022-10-16 14:36:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:36:35,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578574616] [2022-10-16 14:36:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:35,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:36:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:36,378 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-16 14:36:36,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:36:36,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578574616] [2022-10-16 14:36:36,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578574616] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:36:36,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:36:36,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:36:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655723336] [2022-10-16 14:36:36,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:36:36,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:36:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:36:36,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:36:36,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:36:36,424 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.75) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 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 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:36:36,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:36:36,542 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-10-16 14:36:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:36:36,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 14:36:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:36:36,555 INFO L225 Difference]: With dead ends: 160 [2022-10-16 14:36:36,556 INFO L226 Difference]: Without dead ends: 100 [2022-10-16 14:36:36,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 14:36:36,564 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 52 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:36:36,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:36:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-16 14:36:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 57. [2022-10-16 14:36:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:36:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-10-16 14:36:36,609 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 6 [2022-10-16 14:36:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:36:36,610 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-10-16 14:36:36,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:36:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-10-16 14:36:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 14:36:36,611 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:36:36,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:36:36,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 14:36:36,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:36:36,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:36:36,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1808234606, now seen corresponding path program 1 times [2022-10-16 14:36:36,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:36:36,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278383496] [2022-10-16 14:36:36,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:36,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:36:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:36,721 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-16 14:36:36,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:36:36,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278383496] [2022-10-16 14:36:36,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278383496] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:36:36,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:36:36,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:36:36,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386280805] [2022-10-16 14:36:36,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:36:36,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:36:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:36:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:36:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:36:36,726 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:36:36,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:36:36,791 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-10-16 14:36:36,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:36:36,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 14:36:36,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:36:36,793 INFO L225 Difference]: With dead ends: 100 [2022-10-16 14:36:36,793 INFO L226 Difference]: Without dead ends: 57 [2022-10-16 14:36:36,795 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-16 14:36:36,800 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:36:36,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:36:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-16 14:36:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-10-16 14:36:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 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-16 14:36:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-10-16 14:36:36,816 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 7 [2022-10-16 14:36:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:36:36,819 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-10-16 14:36:36,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:36:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-10-16 14:36:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 14:36:36,822 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:36:36,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-10-16 14:36:36,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 14:36:36,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:36:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:36:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1505569711, now seen corresponding path program 1 times [2022-10-16 14:36:36,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:36:36,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893445098] [2022-10-16 14:36:36,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:36,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:36:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:37,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:36:37,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893445098] [2022-10-16 14:36:37,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893445098] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:36:37,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401803915] [2022-10-16 14:36:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:37,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:36:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:36:37,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:36:37,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 14:36:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:37,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 14:36:37,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:36:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:37,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:36:37,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401803915] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:36:37,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:36:37,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-10-16 14:36:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371862149] [2022-10-16 14:36:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:36:37,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:36:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:36:37,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:36:37,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:36:37,325 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-16 14:36:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:36:37,483 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2022-10-16 14:36:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 14:36:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-16 14:36:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:36:37,485 INFO L225 Difference]: With dead ends: 148 [2022-10-16 14:36:37,485 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 14:36:37,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-10-16 14:36:37,488 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:36:37,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 148 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:36:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 14:36:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2022-10-16 14:36:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.525) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 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-16 14:36:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-10-16 14:36:37,498 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2022-10-16 14:36:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:36:37,499 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-10-16 14:36:37,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-16 14:36:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-10-16 14:36:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 14:36:37,500 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:36:37,500 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:36:37,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 14:36:37,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:36:37,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:36:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:36:37,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1505567789, now seen corresponding path program 1 times [2022-10-16 14:36:37,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:36:37,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689273684] [2022-10-16 14:36:37,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:37,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:36:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:37,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:36:37,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689273684] [2022-10-16 14:36:37,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689273684] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:36:37,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908800960] [2022-10-16 14:36:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:37,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:36:37,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:36:37,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:36:37,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 14:36:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:38,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 14:36:38,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:36:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:38,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:36:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:38,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908800960] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:36:38,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:36:38,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 14:36:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084898890] [2022-10-16 14:36:38,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:36:38,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 14:36:38,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:36:38,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 14:36:38,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 14:36:38,103 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 14:36:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:36:38,244 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-10-16 14:36:38,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 14:36:38,245 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 14:36:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:36:38,247 INFO L225 Difference]: With dead ends: 117 [2022-10-16 14:36:38,248 INFO L226 Difference]: Without dead ends: 116 [2022-10-16 14:36:38,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-10-16 14:36:38,250 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 154 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:36:38,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 198 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:36:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-16 14:36:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 70. [2022-10-16 14:36:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:36:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-10-16 14:36:38,261 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 11 [2022-10-16 14:36:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:36:38,261 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-10-16 14:36:38,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 14:36:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-10-16 14:36:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 14:36:38,262 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:36:38,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:36:38,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 14:36:38,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-10-16 14:36:38,479 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:36:38,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:36:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash 570505796, now seen corresponding path program 1 times [2022-10-16 14:36:38,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:36:38,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674980534] [2022-10-16 14:36:38,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:38,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:36:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:36:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674980534] [2022-10-16 14:36:38,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674980534] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:36:38,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449382097] [2022-10-16 14:36:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:38,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:36:38,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:36:38,662 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:36:38,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 14:36:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:38,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 14:36:38,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:36:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:38,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:36:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:38,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449382097] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:36:38,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:36:38,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 14:36:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009860171] [2022-10-16 14:36:38,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:36:38,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 14:36:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:36:38,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 14:36:38,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-10-16 14:36:38,869 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:36:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:36:38,962 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2022-10-16 14:36:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:36:38,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 14:36:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:36:38,964 INFO L225 Difference]: With dead ends: 113 [2022-10-16 14:36:38,964 INFO L226 Difference]: Without dead ends: 70 [2022-10-16 14:36:38,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-10-16 14:36:38,966 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 50 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:36:38,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 164 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:36:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-16 14:36:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-16 14:36:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4) internal successors, (77), 69 states have internal predecessors, (77), 0 states have call successors, (0), 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-16 14:36:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-10-16 14:36:38,974 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 12 [2022-10-16 14:36:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:36:38,975 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-10-16 14:36:38,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:36:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-10-16 14:36:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 14:36:38,976 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:36:38,976 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:36:39,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-16 14:36:39,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:36:39,190 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:36:39,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:36:39,191 INFO L85 PathProgramCache]: Analyzing trace with hash -49050172, now seen corresponding path program 1 times [2022-10-16 14:36:39,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:36:39,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470196018] [2022-10-16 14:36:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:36:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:39,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:36:39,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470196018] [2022-10-16 14:36:39,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470196018] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:36:39,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763334909] [2022-10-16 14:36:39,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:39,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:36:39,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:36:39,429 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:36:39,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 14:36:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:39,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 14:36:39,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:36:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:39,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:36:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:39,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763334909] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:36:39,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:36:39,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-10-16 14:36:39,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757946710] [2022-10-16 14:36:39,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:36:39,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 14:36:39,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:36:39,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 14:36:39,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-10-16 14:36:39,754 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 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-16 14:36:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:36:39,913 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2022-10-16 14:36:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 14:36:39,914 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 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 22 [2022-10-16 14:36:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:36:39,915 INFO L225 Difference]: With dead ends: 115 [2022-10-16 14:36:39,915 INFO L226 Difference]: Without dead ends: 72 [2022-10-16 14:36:39,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-10-16 14:36:39,917 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 63 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:36:39,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 371 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:36:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-16 14:36:39,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-10-16 14:36:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 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-16 14:36:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-10-16 14:36:39,925 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 22 [2022-10-16 14:36:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:36:39,925 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-10-16 14:36:39,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 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-16 14:36:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-10-16 14:36:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 14:36:39,927 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:36:39,927 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2022-10-16 14:36:39,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-16 14:36:40,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:36:40,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:36:40,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:36:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1376079897, now seen corresponding path program 2 times [2022-10-16 14:36:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:36:40,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603208876] [2022-10-16 14:36:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:40,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:36:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:40,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:36:40,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603208876] [2022-10-16 14:36:40,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603208876] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:36:40,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247008533] [2022-10-16 14:36:40,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:36:40,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:36:40,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:36:40,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:36:40,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 14:36:40,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 14:36:40,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:36:40,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 14:36:40,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:36:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:36:40,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:36:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:36:40,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247008533] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:36:40,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:36:40,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2022-10-16 14:36:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162339559] [2022-10-16 14:36:40,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:36:40,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 14:36:40,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:36:40,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 14:36:40,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-10-16 14:36:40,654 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:36:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:36:40,847 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-10-16 14:36:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 14:36:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-16 14:36:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:36:40,850 INFO L225 Difference]: With dead ends: 114 [2022-10-16 14:36:40,850 INFO L226 Difference]: Without dead ends: 113 [2022-10-16 14:36:40,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2022-10-16 14:36:40,853 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 406 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:36:40,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 141 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:36:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-10-16 14:36:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2022-10-16 14:36:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 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-16 14:36:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-10-16 14:36:40,876 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2022-10-16 14:36:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:36:40,877 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-10-16 14:36:40,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:36:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-10-16 14:36:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 14:36:40,878 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:36:40,878 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:36:40,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 14:36:41,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:36:41,093 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:36:41,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:36:41,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1106477380, now seen corresponding path program 2 times [2022-10-16 14:36:41,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:36:41,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056209773] [2022-10-16 14:36:41,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:36:41,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:36:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:36:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:43,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:36:43,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056209773] [2022-10-16 14:36:43,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056209773] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:36:43,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942985500] [2022-10-16 14:36:43,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:36:43,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:36:43,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:36:43,852 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:36:43,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 14:36:43,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 14:36:43,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:36:43,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-10-16 14:36:43,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:36:44,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-10-16 14:36:44,107 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 14:36:44,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 14:36:44,348 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-10-16 14:36:44,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 14:36:44,543 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-10-16 14:36:44,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 14:36:44,736 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-10-16 14:36:44,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 14:36:44,964 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-10-16 14:36:44,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 14:36:45,186 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-10-16 14:36:45,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 34 [2022-10-16 14:36:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:36:45,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:36:56,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (forall ((v_ArrVal_283 Int)) (< (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648)) (not (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))) is different from false [2022-10-16 14:36:57,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 14:36:59,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse0 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4)))))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 14:37:01,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_43| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |v_ULTIMATE.start_main_~i~0#1_43|)) (forall ((v_ArrVal_283 Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (+ (select .cse0 (+ (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)))))) is different from false [2022-10-16 14:37:03,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (+ (select .cse0 (+ (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)))) is different from false [2022-10-16 14:37:05,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)))) is different from false [2022-10-16 14:37:08,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)) (forall ((v_ArrVal_279 Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648))))) is different from false [2022-10-16 14:37:10,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_44| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648))) is different from false [2022-10-16 14:38:13,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_45| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |v_ULTIMATE.start_main_~i~0#1_45|)) (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_44| (+ |v_ULTIMATE.start_main_~i~0#1_45| 1)) (< (let ((.cse0 (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_277) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)))))) is different from false [2022-10-16 14:38:15,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (|v_ULTIMATE.start_main_~i~0#1_45| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_44| (+ |v_ULTIMATE.start_main_~i~0#1_45| 1)) (< (let ((.cse0 (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_277) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_45| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)))) is different from false [2022-10-16 14:38:17,290 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (|ULTIMATE.start_main_~#distance~0#1.offset| Int) (v_ArrVal_275 Int) (|v_ULTIMATE.start_main_~i~0#1_45| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (not (<= v_ArrVal_275 0)) (< (let ((.cse1 (store (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_275) (+ (* |v_ULTIMATE.start_main_~i~0#1_45| 4) |ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_277) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ (* |v_ULTIMATE.start_main_~i~0#1_43| 4) |ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_281) (+ (* |v_ULTIMATE.start_main_~i~0#1_42| 4) |ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_283))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|) (select .cse1 (+ (* (select (select .cse0 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4) |ULTIMATE.start_main_~#distance~0#1.offset|))))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_44| (+ |v_ULTIMATE.start_main_~i~0#1_45| 1)) (< |v_ULTIMATE.start_main_~i~0#1_45| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)))) is different from false [2022-10-16 14:38:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2022-10-16 14:38:17,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942985500] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:38:17,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:38:17,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 17] total 43 [2022-10-16 14:38:17,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849014400] [2022-10-16 14:38:17,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:38:17,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-16 14:38:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:38:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-16 14:38:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=887, Unknown=44, NotChecked=792, Total=1892 [2022-10-16 14:38:17,441 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 44 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:38:35,887 WARN L233 SmtUtils]: Spent 18.24s on a formula simplification. DAG size of input: 76 DAG size of output: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 14:38:37,899 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)) (.cse4 (select .cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (<= .cse0 0) (= .cse0 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (|v_ULTIMATE.start_main_~i~0#1_45| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_44| (+ |v_ULTIMATE.start_main_~i~0#1_45| 1)) (< (let ((.cse1 (store (store (store (store .cse3 (+ (* |v_ULTIMATE.start_main_~i~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_277) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1))) (+ (select .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse2 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse2 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_45| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (<= .cse4 0) (= .cse4 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Weight~0#1.base|)) (= |c_ULTIMATE.start_main_~#Weight~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0)))) is different from false [2022-10-16 14:38:39,911 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (<= .cse0 0) (= .cse0 0) (= (select .cse1 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_45| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |v_ULTIMATE.start_main_~i~0#1_45|)) (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_44| (+ |v_ULTIMATE.start_main_~i~0#1_45| 1)) (< (let ((.cse2 (store (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_277) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2))) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse3 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse3 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)))))) (<= 0 |c_ULTIMATE.start_main_#t~post4#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (<= (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Weight~0#1.base|)) (= |c_ULTIMATE.start_main_#t~post4#1| 0) (= |c_ULTIMATE.start_main_~#Weight~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0))) is different from false [2022-10-16 14:38:44,023 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) (<= .cse0 0) (= .cse0 0) (= (select .cse1 0) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Weight~0#1.base|)) (= |c_ULTIMATE.start_main_~#Weight~0#1.offset| 0) (forall ((v_ArrVal_279 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_44| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< (let ((.cse2 (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2))) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse3 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse3 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648))) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0))) is different from false [2022-10-16 14:38:46,034 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (<= .cse0 0) (= .cse0 0) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 4) 1) |c_ULTIMATE.start_main_#t~post4#1|) (= (select .cse1 0) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (<= (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)) (forall ((v_ArrVal_279 Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< (let ((.cse2 (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2))) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse3 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse3 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648))))) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Weight~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_#t~post4#1|) (= |c_ULTIMATE.start_main_~#Weight~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0))) is different from false [2022-10-16 14:38:52,200 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (<= .cse0 0) (<= (+ 2 (div (* (- 1) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 4)) |c_ULTIMATE.start_main_~i~0#1|) (= .cse0 0) (= (select .cse1 0) 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (forall ((v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_43| .cse2) (< (let ((.cse3 (store (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3))) (+ (select .cse3 (+ (* (select (select .cse4 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)))) (<= (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Weight~0#1.base|)) (= |c_ULTIMATE.start_main_~#Weight~0#1.offset| 0) (forall ((v_ArrVal_279 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse2) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< (let ((.cse5 (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse5))) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse6 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse6 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648))) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0))) is different from false [2022-10-16 14:38:54,212 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~post4#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (<= .cse0 0) (= .cse0 0) (= (select .cse1 0) 0) (<= (+ 2 (div (* (- 1) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 4)) |c_ULTIMATE.start_main_#t~post4#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_43| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_43|)) (forall ((v_ArrVal_283 Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< (let ((.cse3 (store (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3))) (+ (select .cse3 (+ (* (select (select .cse4 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)))))) (<= (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_44|)) (forall ((v_ArrVal_279 Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< (let ((.cse5 (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse5))) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse6 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse6 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648))))) (<= 2 |c_ULTIMATE.start_main_#t~post4#1|) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Weight~0#1.base|)) (= |c_ULTIMATE.start_main_~#Weight~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0))) is different from false [2022-10-16 14:39:00,364 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (<= (+ 3 (div (* (- 1) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 4)) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (<= .cse0 0) (= .cse0 0) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse1 0) 0) (forall ((v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< (let ((.cse2 (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2))) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse3 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse3 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| .cse4))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (forall ((v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_43| .cse4) (< (let ((.cse5 (store (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse5))) (+ (select .cse5 (+ (* (select (select .cse6 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (select (select .cse6 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)))) (<= (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Weight~0#1.base|)) (= |c_ULTIMATE.start_main_~#Weight~0#1.offset| 0) (forall ((v_ArrVal_279 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse4) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< (let ((.cse7 (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse7))) (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse8 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse8 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648))) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0))) is different from false [2022-10-16 14:39:02,376 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_#t~post4#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (<= 3 |c_ULTIMATE.start_main_#t~post4#1|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (<= .cse0 0) (= .cse0 0) (= (select .cse1 0) 0) (<= (+ 3 (div (* (- 1) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 4)) |c_ULTIMATE.start_main_#t~post4#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (forall ((v_ArrVal_283 Int)) (< (let ((.cse2 (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2))) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse3 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse3 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648)) (not (<= .cse4 |v_ULTIMATE.start_main_~i~0#1_42|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_43| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_~i~0#1_43|)) (forall ((v_ArrVal_283 Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< (let ((.cse5 (store (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse5))) (+ (select .cse5 (+ (* (select (select .cse6 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (select (select .cse6 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)))))) (<= (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_~i~0#1_44|)) (forall ((v_ArrVal_279 Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (v_ArrVal_281 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1)) (< |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< (let ((.cse7 (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_283))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse7))) (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse8 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse8 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|)))) 2147483648))))) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Weight~0#1.base|)) (= |c_ULTIMATE.start_main_~#Weight~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0))) is different from false [2022-10-16 14:39:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:39:28,616 INFO L93 Difference]: Finished difference Result 301 states and 327 transitions. [2022-10-16 14:39:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-16 14:39:28,617 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 44 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-16 14:39:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:39:28,619 INFO L225 Difference]: With dead ends: 301 [2022-10-16 14:39:28,619 INFO L226 Difference]: Without dead ends: 300 [2022-10-16 14:39:28,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 19 IntricatePredicates, 1 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 162.6s TimeCoverageRelationStatistics Valid=367, Invalid=1995, Unknown=66, NotChecked=2128, Total=4556 [2022-10-16 14:39:28,622 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 421 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1778 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 14:39:28,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1106 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 519 Invalid, 0 Unknown, 1778 Unchecked, 0.6s Time] [2022-10-16 14:39:28,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-10-16 14:39:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 109. [2022-10-16 14:39:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 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-16 14:39:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2022-10-16 14:39:28,636 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 32 [2022-10-16 14:39:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:39:28,636 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2022-10-16 14:39:28,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 44 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:39:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2022-10-16 14:39:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 14:39:28,638 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:39:28,638 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:39:28,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 14:39:28,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:39:28,854 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:39:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:39:28,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1802286522, now seen corresponding path program 1 times [2022-10-16 14:39:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:39:28,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075423520] [2022-10-16 14:39:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:39:28,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:39:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:39:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 14:39:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:39:28,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075423520] [2022-10-16 14:39:28,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075423520] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:39:28,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:39:28,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:39:28,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573861353] [2022-10-16 14:39:28,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:39:28,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:39:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:39:28,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:39:28,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:39:28,912 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:39:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:39:28,942 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2022-10-16 14:39:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:39:28,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-16 14:39:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:39:28,943 INFO L225 Difference]: With dead ends: 151 [2022-10-16 14:39:28,943 INFO L226 Difference]: Without dead ends: 84 [2022-10-16 14:39:28,944 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-16 14:39:28,944 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:39:28,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 88 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:39:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-10-16 14:39:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-10-16 14:39:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 83 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 14:39:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2022-10-16 14:39:28,954 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 32 [2022-10-16 14:39:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:39:28,954 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2022-10-16 14:39:28,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:39:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2022-10-16 14:39:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 14:39:28,956 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:39:28,956 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:39:28,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 14:39:28,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:39:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:39:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash -58940763, now seen corresponding path program 1 times [2022-10-16 14:39:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:39:28,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701261842] [2022-10-16 14:39:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:39:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:39:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:39:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-16 14:39:29,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:39:29,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701261842] [2022-10-16 14:39:29,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701261842] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:39:29,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:39:29,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 14:39:29,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539207068] [2022-10-16 14:39:29,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:39:29,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:39:29,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:39:29,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:39:29,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:39:29,042 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:39:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:39:29,072 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2022-10-16 14:39:29,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:39:29,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-16 14:39:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:39:29,073 INFO L225 Difference]: With dead ends: 159 [2022-10-16 14:39:29,073 INFO L226 Difference]: Without dead ends: 104 [2022-10-16 14:39:29,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:39:29,075 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 76 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:39:29,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 98 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:39:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-16 14:39:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2022-10-16 14:39:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 14:39:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-10-16 14:39:29,084 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 33 [2022-10-16 14:39:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:39:29,085 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-10-16 14:39:29,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:39:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-10-16 14:39:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 14:39:29,086 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:39:29,086 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:39:29,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 14:39:29,087 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:39:29,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:39:29,087 INFO L85 PathProgramCache]: Analyzing trace with hash -58939513, now seen corresponding path program 1 times [2022-10-16 14:39:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:39:29,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434660180] [2022-10-16 14:39:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:39:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:39:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:39:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:39:31,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:39:31,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434660180] [2022-10-16 14:39:31,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434660180] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:39:31,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983172633] [2022-10-16 14:39:31,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:39:31,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:39:31,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:39:31,217 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:39:31,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 14:39:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:39:31,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 46 conjunts are in the unsatisfiable core [2022-10-16 14:39:31,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:39:31,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-10-16 14:39:31,438 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 14:39:31,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 14:39:31,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:39:31,717 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 14:39:31,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 14:39:31,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:39:31,957 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 14:39:31,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 14:39:32,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:39:32,200 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 14:39:32,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 14:39:32,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:39:32,522 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 14:39:32,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 14:39:32,796 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-10-16 14:39:32,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 32 [2022-10-16 14:39:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:39:32,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:40:31,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_49| Int) (v_ArrVal_393 Int)) (or (< 0 (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_49| 4)) v_ArrVal_393))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1))) (+ 2147483649 (select (select .cse0 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|) (select .cse1 (+ (* (select (select .cse0 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))))) (< |v_ULTIMATE.start_main_~i~0#1_49| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false