/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/array-fpi/s52iff.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:54:51,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:54:51,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:54:51,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:54:51,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:54:51,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:54:51,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:54:51,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:54:51,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:54:51,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:54:51,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:54:51,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:54:51,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:54:51,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:54:51,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:54:51,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:54:51,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:54:51,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:54:51,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:54:51,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:54:51,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:54:51,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:54:51,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:54:51,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:54:51,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:54:51,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:54:51,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:54:51,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:54:51,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:54:51,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:54:51,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:54:51,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:54:51,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:54:51,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:54:51,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:54:51,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:54:51,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:54:51,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:54:51,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:54:51,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:54:51,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:54:51,493 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 10:54:51,551 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:54:51,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:54:51,552 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:54:51,552 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:54:51,554 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:54:51,554 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:54:51,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:54:51,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:54:51,558 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:54:51,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:54:51,559 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:54:51,559 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:54:51,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:54:51,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:54:51,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:54:51,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:54:51,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:54:51,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:54:51,561 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:54:51,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:54:51,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:54:51,561 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:54:51,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:54:51,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:54:51,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:54:51,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:54:51,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:54:51,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:54:51,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:54:51,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:54:51,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:54:51,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:54:51,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:54:51,564 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 10:54:51,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:54:52,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:54:52,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:54:52,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:54:52,015 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:54:52,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s52iff.c [2022-10-16 10:54:52,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718d837ca/a630b16bbfee4f5a9abb7f6e7ec68b36/FLAG07613ff1f [2022-10-16 10:54:52,729 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:54:52,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s52iff.c [2022-10-16 10:54:52,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718d837ca/a630b16bbfee4f5a9abb7f6e7ec68b36/FLAG07613ff1f [2022-10-16 10:54:53,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718d837ca/a630b16bbfee4f5a9abb7f6e7ec68b36 [2022-10-16 10:54:53,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:54:53,113 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:54:53,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:54:53,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:54:53,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:54:53,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290a4dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53, skipping insertion in model container [2022-10-16 10:54:53,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:54:53,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:54:53,351 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/array-fpi/s52iff.c[589,602] [2022-10-16 10:54:53,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:54:53,410 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:54:53,431 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/array-fpi/s52iff.c[589,602] [2022-10-16 10:54:53,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:54:53,480 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:54:53,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53 WrapperNode [2022-10-16 10:54:53,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:54:53,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:54:53,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:54:53,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:54:53,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,563 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2022-10-16 10:54:53,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:54:53,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:54:53,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:54:53,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:54:53,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,625 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:54:53,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:54:53,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:54:53,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:54:53,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (1/1) ... [2022-10-16 10:54:53,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:54:53,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:53,690 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 10:54:53,714 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 10:54:53,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:54:53,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:54:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:54:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:54:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:54:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:54:53,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:54:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:54:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:54:53,844 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:54:53,846 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:54:54,119 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:54:54,129 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:54:54,129 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 10:54:54,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:54:54 BoogieIcfgContainer [2022-10-16 10:54:54,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:54:54,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:54:54,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:54:54,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:54:54,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:54:53" (1/3) ... [2022-10-16 10:54:54,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407935e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:54:54, skipping insertion in model container [2022-10-16 10:54:54,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:54:53" (2/3) ... [2022-10-16 10:54:54,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407935e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:54:54, skipping insertion in model container [2022-10-16 10:54:54,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:54:54" (3/3) ... [2022-10-16 10:54:54,144 INFO L112 eAbstractionObserver]: Analyzing ICFG s52iff.c [2022-10-16 10:54:54,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:54:54,173 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-16 10:54:54,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:54:54,299 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;@13437887, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:54:54,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-16 10:54:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 53 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 10:54:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:54:54,314 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:54,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:54,315 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 10:54:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:54:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:54,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094667527] [2022-10-16 10:54:54,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:54,533 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 10:54:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:54,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094667527] [2022-10-16 10:54:54,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094667527] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:54:54,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:54:54,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:54:54,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334151139] [2022-10-16 10:54:54,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:54:54,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:54:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:54:54,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:54:54,583 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 53 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:54,606 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2022-10-16 10:54:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:54:54,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-16 10:54:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:54,624 INFO L225 Difference]: With dead ends: 104 [2022-10-16 10:54:54,624 INFO L226 Difference]: Without dead ends: 48 [2022-10-16 10:54:54,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:54:54,646 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:54,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:54:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-16 10:54:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-16 10:54:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.625) internal successors, (52), 47 states have internal predecessors, (52), 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 10:54:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-10-16 10:54:54,702 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 8 [2022-10-16 10:54:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:54,702 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-10-16 10:54:54,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-10-16 10:54:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:54:54,703 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:54,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:54,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:54:54,712 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:54:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:54,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762594476] [2022-10-16 10:54:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:54,892 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 10:54:54,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:54,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762594476] [2022-10-16 10:54:54,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762594476] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:54:54,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:54:54,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:54:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721426589] [2022-10-16 10:54:54,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:54:54,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:54:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:54:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:54:54,897 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:55,002 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-10-16 10:54:55,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:54:55,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-16 10:54:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:55,005 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:54:55,005 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 10:54:55,006 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 10:54:55,008 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:55,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 97 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:54:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 10:54:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2022-10-16 10:54:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-10-16 10:54:55,021 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 8 [2022-10-16 10:54:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:55,021 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-10-16 10:54:55,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-10-16 10:54:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 10:54:55,022 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:55,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:55,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:54:55,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:55,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 678258903, now seen corresponding path program 1 times [2022-10-16 10:54:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:55,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709486848] [2022-10-16 10:54:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:55,206 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 10:54:55,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:55,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709486848] [2022-10-16 10:54:55,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709486848] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:54:55,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:54:55,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:54:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761478642] [2022-10-16 10:54:55,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:54:55,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:54:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:54:55,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:54:55,210 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:55,346 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-10-16 10:54:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:54:55,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 10:54:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:55,348 INFO L225 Difference]: With dead ends: 118 [2022-10-16 10:54:55,349 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:54:55,349 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 10:54:55,351 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 81 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:55,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:54:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:54:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. [2022-10-16 10:54:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 51 states have internal predecessors, (56), 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 10:54:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-10-16 10:54:55,363 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2022-10-16 10:54:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:55,364 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-10-16 10:54:55,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-10-16 10:54:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:54:55,365 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:55,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:55,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:54:55,366 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 10:54:55,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:54:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:55,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116645059] [2022-10-16 10:54:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:55,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:55,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116645059] [2022-10-16 10:54:55,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116645059] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:54:55,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521327113] [2022-10-16 10:54:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:55,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:55,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:55,544 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 10:54:55,560 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 10:54:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:55,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:54:55,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:55,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:54:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:55,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521327113] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:54:55,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:54:55,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:54:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803380991] [2022-10-16 10:54:55,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:54:55,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:54:55,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:55,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:54:55,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:54:55,846 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 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 10:54:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:56,065 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-10-16 10:54:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:54:56,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 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 10:54:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:56,069 INFO L225 Difference]: With dead ends: 99 [2022-10-16 10:54:56,069 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 10:54:56,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:54:56,072 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 89 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:56,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 157 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:54:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 10:54:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2022-10-16 10:54:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5) internal successors, (72), 62 states have internal predecessors, (72), 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 10:54:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-10-16 10:54:56,086 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 12 [2022-10-16 10:54:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:56,086 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-10-16 10:54:56,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 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 10:54:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-10-16 10:54:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:54:56,088 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:56,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:56,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-16 10:54:56,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:56,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:56,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:54:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:56,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903608337] [2022-10-16 10:54:56,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:56,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:56,451 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 10:54:56,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:56,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903608337] [2022-10-16 10:54:56,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903608337] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:54:56,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46879242] [2022-10-16 10:54:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:56,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:56,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:56,454 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 10:54:56,471 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 10:54:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:56,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:54:56,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:56,555 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 10:54:56,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:54:56,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46879242] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:54:56,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:54:56,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:54:56,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689504867] [2022-10-16 10:54:56,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:54:56,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:54:56,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:56,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:54:56,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:54:56,559 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 10:54:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:56,645 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-10-16 10:54:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:54:56,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 10:54:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:56,647 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:54:56,647 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 10:54:56,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:54:56,649 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 40 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:56,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 110 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:54:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 10:54:56,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2022-10-16 10:54:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.4375) internal successors, (69), 61 states have internal predecessors, (69), 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 10:54:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-10-16 10:54:56,659 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 13 [2022-10-16 10:54:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:56,660 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-10-16 10:54:56,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 10:54:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-10-16 10:54:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:54:56,661 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:56,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:56,697 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 10:54:56,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:56,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:56,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:56,876 INFO L85 PathProgramCache]: Analyzing trace with hash -825622317, now seen corresponding path program 1 times [2022-10-16 10:54:56,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:56,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999844165] [2022-10-16 10:54:56,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:57,170 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 10:54:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:57,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999844165] [2022-10-16 10:54:57,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999844165] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:54:57,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619914691] [2022-10-16 10:54:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:57,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:57,173 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 10:54:57,199 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 10:54:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:57,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-16 10:54:57,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:57,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-10-16 10:54:57,363 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 10:54:57,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:54:57,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 12 [2022-10-16 10:54:57,411 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 10:54:57,423 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 10:54:57,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619914691] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:54:57,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:54:57,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-10-16 10:54:57,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919937077] [2022-10-16 10:54:57,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:54:57,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 10:54:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:57,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 10:54:57,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-10-16 10:54:57,426 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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 10:54:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:57,540 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2022-10-16 10:54:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 10:54:57,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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 14 [2022-10-16 10:54:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:57,541 INFO L225 Difference]: With dead ends: 121 [2022-10-16 10:54:57,542 INFO L226 Difference]: Without dead ends: 86 [2022-10-16 10:54:57,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:54:57,544 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:57,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 205 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:54:57,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-16 10:54:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2022-10-16 10:54:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 62 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 10:54:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-10-16 10:54:57,553 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 14 [2022-10-16 10:54:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:57,553 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-10-16 10:54:57,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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 10:54:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-10-16 10:54:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:54:57,555 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:57,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:57,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 10:54:57,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:57,770 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash -825622509, now seen corresponding path program 1 times [2022-10-16 10:54:57,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:57,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498837281] [2022-10-16 10:54:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:54:57,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:57,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498837281] [2022-10-16 10:54:57,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498837281] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:54:57,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:54:57,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:54:57,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763301838] [2022-10-16 10:54:57,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:54:57,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:54:57,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:57,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:54:57,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:54:57,852 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) 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 10:54:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:57,892 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-10-16 10:54:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:54:57,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) 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 14 [2022-10-16 10:54:57,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:57,893 INFO L225 Difference]: With dead ends: 63 [2022-10-16 10:54:57,893 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 10:54:57,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:54:57,895 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:57,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:54:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 10:54:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-16 10:54:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 60 states have internal predecessors, (68), 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 10:54:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-10-16 10:54:57,912 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2022-10-16 10:54:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:57,913 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-10-16 10:54:57,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) 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 10:54:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-10-16 10:54:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 10:54:57,918 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:57,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:57,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 10:54:57,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:57,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1157615292, now seen corresponding path program 1 times [2022-10-16 10:54:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:57,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545745826] [2022-10-16 10:54:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:54:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:58,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545745826] [2022-10-16 10:54:58,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545745826] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:54:58,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:54:58,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:54:58,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242881721] [2022-10-16 10:54:58,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:54:58,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:54:58,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:58,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:54:58,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:54:58,007 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 10:54:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:58,067 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-10-16 10:54:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:54:58,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 10:54:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:58,068 INFO L225 Difference]: With dead ends: 82 [2022-10-16 10:54:58,069 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:54:58,069 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 10:54:58,070 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:58,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 92 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:54:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:54:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-10-16 10:54:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 65 states have internal predecessors, (73), 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 10:54:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-10-16 10:54:58,079 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2022-10-16 10:54:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:58,079 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-10-16 10:54:58,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 10:54:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-10-16 10:54:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 10:54:58,081 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:58,081 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:58,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 10:54:58,081 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:58,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 250320491, now seen corresponding path program 1 times [2022-10-16 10:54:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:58,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618786734] [2022-10-16 10:54:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:58,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:58,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:58,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618786734] [2022-10-16 10:54:58,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618786734] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:54:58,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113352255] [2022-10-16 10:54:58,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:58,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:58,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:58,224 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 10:54:58,236 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 10:54:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:58,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:54:58,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:58,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:54:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:58,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113352255] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:54:58,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:54:58,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:54:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211669553] [2022-10-16 10:54:58,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:54:58,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:54:58,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:58,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:54:58,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:54:58,466 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:58,698 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-10-16 10:54:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:54:58,699 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-16 10:54:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:58,700 INFO L225 Difference]: With dead ends: 155 [2022-10-16 10:54:58,700 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 10:54:58,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:54:58,704 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 113 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:58,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 307 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:54:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 10:54:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2022-10-16 10:54:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.356164383561644) 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 10:54:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-10-16 10:54:58,731 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 21 [2022-10-16 10:54:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:58,731 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-10-16 10:54:58,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-10-16 10:54:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:54:58,734 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:58,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:58,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 10:54:58,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:58,950 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 38416049, now seen corresponding path program 1 times [2022-10-16 10:54:58,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:58,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651755969] [2022-10-16 10:54:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:58,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:54:58,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281331337] [2022-10-16 10:54:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:58,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:58,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:58,970 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 10:54:58,994 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 10:54:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:59,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-16 10:54:59,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:59,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-10-16 10:54:59,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-10-16 10:54:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:54:59,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:54:59,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 31 [2022-10-16 10:54:59,293 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 10:54:59,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2022-10-16 10:54:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:54:59,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:59,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651755969] [2022-10-16 10:54:59,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:54:59,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281331337] [2022-10-16 10:54:59,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281331337] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:54:59,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:54:59,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-10-16 10:54:59,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561737377] [2022-10-16 10:54:59,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:54:59,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:54:59,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:59,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:54:59,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:54:59,311 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:59,593 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2022-10-16 10:54:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:54:59,593 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 10:54:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:59,595 INFO L225 Difference]: With dead ends: 153 [2022-10-16 10:54:59,595 INFO L226 Difference]: Without dead ends: 126 [2022-10-16 10:54:59,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:54:59,596 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 94 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:59,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 319 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:54:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-10-16 10:54:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2022-10-16 10:54:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 96 states have internal predecessors, (115), 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 10:54:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2022-10-16 10:54:59,605 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 23 [2022-10-16 10:54:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:59,605 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2022-10-16 10:54:59,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-10-16 10:54:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:54:59,606 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:59,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:59,644 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 10:54:59,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-16 10:54:59,822 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash 38415857, now seen corresponding path program 1 times [2022-10-16 10:54:59,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:59,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872271691] [2022-10-16 10:54:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:59,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:55:00,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:00,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872271691] [2022-10-16 10:55:00,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872271691] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:55:00,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:55:00,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:55:00,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214972778] [2022-10-16 10:55:00,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:55:00,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:55:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:55:00,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:55:00,035 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 10:55:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:00,109 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-10-16 10:55:00,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 10:55:00,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2022-10-16 10:55:00,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:00,111 INFO L225 Difference]: With dead ends: 108 [2022-10-16 10:55:00,111 INFO L226 Difference]: Without dead ends: 106 [2022-10-16 10:55:00,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 10:55:00,113 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:00,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 115 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:55:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-16 10:55:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-10-16 10:55:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 101 states have internal predecessors, (121), 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 10:55:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2022-10-16 10:55:00,122 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 23 [2022-10-16 10:55:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:00,123 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2022-10-16 10:55:00,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 10:55:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-10-16 10:55:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:55:00,124 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:00,124 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:00,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 10:55:00,125 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:55:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:00,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942032189] [2022-10-16 10:55:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:00,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:00,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:00,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942032189] [2022-10-16 10:55:00,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942032189] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:00,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562036492] [2022-10-16 10:55:00,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:55:00,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:00,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:00,269 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 10:55:00,288 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 10:55:00,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:55:00,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:00,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:55:00,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:55:00,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:55:00,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562036492] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:00,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:00,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:55:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48675513] [2022-10-16 10:55:00,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:00,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:55:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:00,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:55:00,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:55:00,451 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:00,695 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2022-10-16 10:55:00,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:55:00,695 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 10:55:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:00,696 INFO L225 Difference]: With dead ends: 124 [2022-10-16 10:55:00,696 INFO L226 Difference]: Without dead ends: 123 [2022-10-16 10:55:00,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:55:00,698 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 206 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:00,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 170 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:55:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-10-16 10:55:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 91. [2022-10-16 10:55:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 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 10:55:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-10-16 10:55:00,707 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 24 [2022-10-16 10:55:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:00,707 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-10-16 10:55:00,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-10-16 10:55:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 10:55:00,708 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:00,709 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:00,749 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 10:55:00,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:00,924 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1920559343, now seen corresponding path program 2 times [2022-10-16 10:55:00,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:00,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233888838] [2022-10-16 10:55:00,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:01,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:01,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233888838] [2022-10-16 10:55:01,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233888838] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:01,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77676936] [2022-10-16 10:55:01,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:55:01,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:01,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:01,243 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 10:55:01,245 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 10:55:01,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:55:01,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:01,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 10:55:01,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:01,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:55:01,438 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:01,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:01,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:01,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 14 [2022-10-16 10:55:01,564 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 20 treesize of output 16 [2022-10-16 10:55:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:01,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77676936] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:01,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:01,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2022-10-16 10:55:01,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608380285] [2022-10-16 10:55:01,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:01,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:55:01,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:01,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:55:01,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:55:01,585 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:01,876 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2022-10-16 10:55:01,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:55:01,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 10:55:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:01,878 INFO L225 Difference]: With dead ends: 156 [2022-10-16 10:55:01,878 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 10:55:01,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:55:01,879 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:01,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 317 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:55:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 10:55:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2022-10-16 10:55:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 92 states have internal predecessors, (111), 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 10:55:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-10-16 10:55:01,890 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 25 [2022-10-16 10:55:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:01,891 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-10-16 10:55:01,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-10-16 10:55:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:55:01,897 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:01,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:01,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:02,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:02,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1985602653, now seen corresponding path program 1 times [2022-10-16 10:55:02,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:02,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310133015] [2022-10-16 10:55:02,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:02,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:55:02,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:02,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310133015] [2022-10-16 10:55:02,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310133015] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:55:02,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:55:02,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:55:02,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328884294] [2022-10-16 10:55:02,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:55:02,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:55:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:55:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:55:02,176 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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 10:55:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:02,235 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2022-10-16 10:55:02,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:55:02,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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 26 [2022-10-16 10:55:02,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:02,236 INFO L225 Difference]: With dead ends: 105 [2022-10-16 10:55:02,236 INFO L226 Difference]: Without dead ends: 103 [2022-10-16 10:55:02,239 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 10:55:02,240 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:02,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 99 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:55:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-16 10:55:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-10-16 10:55:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 100 states have internal predecessors, (121), 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 10:55:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-10-16 10:55:02,248 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 26 [2022-10-16 10:55:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:02,248 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-10-16 10:55:02,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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 10:55:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-10-16 10:55:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 10:55:02,251 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:02,252 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:02,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 10:55:02,253 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:02,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2118394144, now seen corresponding path program 1 times [2022-10-16 10:55:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:02,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017679691] [2022-10-16 10:55:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:02,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:55:02,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:02,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017679691] [2022-10-16 10:55:02,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017679691] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:02,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119231001] [2022-10-16 10:55:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:02,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:02,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:02,378 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:02,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 10:55:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:02,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:55:02,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:55:02,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:55:02,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119231001] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:02,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:02,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:55:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694596885] [2022-10-16 10:55:02,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:02,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:55:02,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:02,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:55:02,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:55:02,528 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:02,680 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2022-10-16 10:55:02,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:55:02,681 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-16 10:55:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:02,683 INFO L225 Difference]: With dead ends: 148 [2022-10-16 10:55:02,683 INFO L226 Difference]: Without dead ends: 147 [2022-10-16 10:55:02,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:55:02,687 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 68 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:02,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 152 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:55:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-10-16 10:55:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2022-10-16 10:55:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 131 states have internal predecessors, (165), 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 10:55:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 165 transitions. [2022-10-16 10:55:02,700 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 165 transitions. Word has length 28 [2022-10-16 10:55:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:02,701 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 165 transitions. [2022-10-16 10:55:02,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 165 transitions. [2022-10-16 10:55:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:55:02,703 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:02,703 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:02,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:02,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 10:55:02,918 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:02,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:02,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1245709113, now seen corresponding path program 1 times [2022-10-16 10:55:02,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:02,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118990332] [2022-10-16 10:55:02,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:02,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:55:02,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:02,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118990332] [2022-10-16 10:55:02,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118990332] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:02,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776245422] [2022-10-16 10:55:02,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:02,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:02,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:02,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:03,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 10:55:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:03,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:55:03,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:55:03,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:55:03,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776245422] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:55:03,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:55:03,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:55:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064150616] [2022-10-16 10:55:03,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:55:03,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:55:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:03,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:55:03,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:55:03,101 INFO L87 Difference]: Start difference. First operand 132 states and 165 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 10:55:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:03,195 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-10-16 10:55:03,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:55:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 29 [2022-10-16 10:55:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:03,197 INFO L225 Difference]: With dead ends: 134 [2022-10-16 10:55:03,197 INFO L226 Difference]: Without dead ends: 133 [2022-10-16 10:55:03,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:55:03,198 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:03,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 142 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:55:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-10-16 10:55:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-10-16 10:55:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.322314049586777) internal successors, (160), 130 states have internal predecessors, (160), 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 10:55:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2022-10-16 10:55:03,210 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 29 [2022-10-16 10:55:03,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:03,211 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2022-10-16 10:55:03,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 10:55:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-10-16 10:55:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 10:55:03,213 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:03,214 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:03,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:03,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 10:55:03,428 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 874414924, now seen corresponding path program 1 times [2022-10-16 10:55:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:03,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411255659] [2022-10-16 10:55:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:03,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:55:03,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519287985] [2022-10-16 10:55:03,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:03,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:03,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:03,447 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:03,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 10:55:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:03,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:55:03,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:55:03,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:55:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:03,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411255659] [2022-10-16 10:55:03,691 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:55:03,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519287985] [2022-10-16 10:55:03,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519287985] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:03,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:55:03,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-10-16 10:55:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5963055] [2022-10-16 10:55:03,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:03,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:55:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:03,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:55:03,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:55:03,694 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 10:55:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:03,876 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2022-10-16 10:55:03,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:55:03,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 30 [2022-10-16 10:55:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:03,878 INFO L225 Difference]: With dead ends: 143 [2022-10-16 10:55:03,878 INFO L226 Difference]: Without dead ends: 110 [2022-10-16 10:55:03,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-10-16 10:55:03,879 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 63 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:03,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 239 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:55:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-16 10:55:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2022-10-16 10:55:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 104 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 10:55:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2022-10-16 10:55:03,886 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 30 [2022-10-16 10:55:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:03,887 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2022-10-16 10:55:03,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 10:55:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-10-16 10:55:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 10:55:03,887 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:03,888 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:03,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:04,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 10:55:04,103 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:04,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1892149553, now seen corresponding path program 3 times [2022-10-16 10:55:04,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:04,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274958914] [2022-10-16 10:55:04,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:04,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:04,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274958914] [2022-10-16 10:55:04,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274958914] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:04,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803914295] [2022-10-16 10:55:04,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:55:04,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:04,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:04,322 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:04,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 10:55:04,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:55:04,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:04,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:55:04,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:04,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:04,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803914295] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:04,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:04,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:55:04,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030769998] [2022-10-16 10:55:04,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:04,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:55:04,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:04,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:55:04,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:55:04,664 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 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 10:55:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:05,005 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2022-10-16 10:55:05,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:55:05,006 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 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) Word has length 32 [2022-10-16 10:55:05,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:05,007 INFO L225 Difference]: With dead ends: 238 [2022-10-16 10:55:05,007 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:55:05,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:55:05,009 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 204 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:05,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 259 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:55:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:55:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 142. [2022-10-16 10:55:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.303030303030303) internal successors, (172), 141 states have internal predecessors, (172), 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 10:55:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2022-10-16 10:55:05,018 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 32 [2022-10-16 10:55:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:05,018 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2022-10-16 10:55:05,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 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 10:55:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2022-10-16 10:55:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:55:05,019 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:05,019 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:05,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:05,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 10:55:05,236 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:05,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1277475512, now seen corresponding path program 2 times [2022-10-16 10:55:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:05,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626128759] [2022-10-16 10:55:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:05,253 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:55:05,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [235975769] [2022-10-16 10:55:05,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:55:05,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:05,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:05,255 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:05,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 10:55:05,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:55:05,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:05,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:55:05,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:55:05,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:55:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626128759] [2022-10-16 10:55:05,494 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:55:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235975769] [2022-10-16 10:55:05,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235975769] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:05,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:55:05,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-10-16 10:55:05,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457111218] [2022-10-16 10:55:05,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:05,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:55:05,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:05,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:55:05,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:55:05,497 INFO L87 Difference]: Start difference. First operand 142 states and 172 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:05,703 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2022-10-16 10:55:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 10:55:05,703 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-10-16 10:55:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:05,704 INFO L225 Difference]: With dead ends: 187 [2022-10-16 10:55:05,705 INFO L226 Difference]: Without dead ends: 144 [2022-10-16 10:55:05,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-10-16 10:55:05,706 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:05,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 163 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:55:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-10-16 10:55:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2022-10-16 10:55:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.2878787878787878) internal successors, (170), 141 states have internal predecessors, (170), 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 10:55:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2022-10-16 10:55:05,715 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 34 [2022-10-16 10:55:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:05,716 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2022-10-16 10:55:05,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2022-10-16 10:55:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:55:05,717 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:05,717 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:05,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:05,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:05,930 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:05,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash 315378123, now seen corresponding path program 4 times [2022-10-16 10:55:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:05,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332026878] [2022-10-16 10:55:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:06,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:06,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332026878] [2022-10-16 10:55:06,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332026878] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:06,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978242804] [2022-10-16 10:55:06,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:55:06,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:06,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:06,790 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:06,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 10:55:06,874 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:55:06,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:06,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 10:55:06,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:06,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:55:07,036 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:07,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:07,119 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:07,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:07,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:07,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 14 [2022-10-16 10:55:07,384 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 20 treesize of output 16 [2022-10-16 10:55:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:07,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978242804] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:07,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:07,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 32 [2022-10-16 10:55:07,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408829966] [2022-10-16 10:55:07,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:07,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:55:07,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:07,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:55:07,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:55:07,414 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 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 10:55:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:08,230 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-10-16 10:55:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:55:08,231 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 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 36 [2022-10-16 10:55:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:08,232 INFO L225 Difference]: With dead ends: 199 [2022-10-16 10:55:08,232 INFO L226 Difference]: Without dead ends: 146 [2022-10-16 10:55:08,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2022-10-16 10:55:08,236 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 76 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:08,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 740 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 10:55:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-10-16 10:55:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2022-10-16 10:55:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 132 states have internal predecessors, (156), 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 10:55:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2022-10-16 10:55:08,246 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 36 [2022-10-16 10:55:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:08,247 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2022-10-16 10:55:08,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 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 10:55:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2022-10-16 10:55:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:55:08,248 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:08,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:08,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:08,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-10-16 10:55:08,464 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1855075176, now seen corresponding path program 3 times [2022-10-16 10:55:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:08,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503039825] [2022-10-16 10:55:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:08,496 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:55:08,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170345141] [2022-10-16 10:55:08,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:55:08,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:08,498 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:08,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 10:55:08,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:55:08,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:08,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-16 10:55:08,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:08,597 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 10 treesize of output 8 [2022-10-16 10:55:08,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:55:08,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:55:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:55:09,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:09,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_76| c_~N~0)))) is different from false [2022-10-16 10:55:09,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_76| 1)) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_76| 1))) is different from false [2022-10-16 10:55:09,436 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (< |c_ULTIMATE.start_main_#t~post7#1| |v_ULTIMATE.start_main_~i~0#1_76|))) is different from false [2022-10-16 10:55:09,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_76|))) is different from false [2022-10-16 10:55:09,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_76|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 5 |c_ULTIMATE.start_main_#t~mem9#1|))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 6))) is different from false [2022-10-16 10:55:09,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:55:09,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-10-16 10:55:09,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:55:09,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2022-10-16 10:55:09,588 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 13 treesize of output 7 [2022-10-16 10:55:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 7 not checked. [2022-10-16 10:55:09,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:09,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503039825] [2022-10-16 10:55:09,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:55:09,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170345141] [2022-10-16 10:55:09,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170345141] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:09,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:55:09,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-10-16 10:55:09,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070911408] [2022-10-16 10:55:09,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:09,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 10:55:09,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:09,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 10:55:09,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=565, Unknown=6, NotChecked=260, Total=930 [2022-10-16 10:55:09,767 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 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 10:55:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:10,403 INFO L93 Difference]: Finished difference Result 188 states and 231 transitions. [2022-10-16 10:55:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:55:10,403 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:55:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:10,405 INFO L225 Difference]: With dead ends: 188 [2022-10-16 10:55:10,405 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:55:10,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=1008, Unknown=17, NotChecked=350, Total=1560 [2022-10-16 10:55:10,407 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:10,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 305 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 355 Unchecked, 0.1s Time] [2022-10-16 10:55:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:55:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-10-16 10:55:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 158 states have internal predecessors, (192), 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 10:55:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 192 transitions. [2022-10-16 10:55:10,420 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 192 transitions. Word has length 41 [2022-10-16 10:55:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:10,421 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 192 transitions. [2022-10-16 10:55:10,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 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 10:55:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 192 transitions. [2022-10-16 10:55:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:55:10,422 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:10,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:10,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-10-16 10:55:10,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:10,638 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1855074984, now seen corresponding path program 1 times [2022-10-16 10:55:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:10,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186567728] [2022-10-16 10:55:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:55:11,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:11,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186567728] [2022-10-16 10:55:11,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186567728] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:11,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886167654] [2022-10-16 10:55:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:11,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:11,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:11,035 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:11,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 10:55:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:11,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjunts are in the unsatisfiable core [2022-10-16 10:55:11,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:11,142 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 10 treesize of output 8 [2022-10-16 10:55:11,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:55:11,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:55:11,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:55:11,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:55:11,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:55:11,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-10-16 10:55:11,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:55:11,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 30 [2022-10-16 10:55:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:55:11,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:13,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_509 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_86| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_509))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_509 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_510)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_86| 4))))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse1) v_ArrVal_510) (< (+ v_ArrVal_510 .cse2) 9223372036854775808) (< 6 .cse1) (< 6 .cse2)))))) is different from false [2022-10-16 10:55:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2022-10-16 10:55:13,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886167654] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:13,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:13,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2022-10-16 10:55:13,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285687727] [2022-10-16 10:55:13,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:13,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:55:13,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:13,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:55:13,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=325, Unknown=1, NotChecked=38, Total=462 [2022-10-16 10:55:13,829 INFO L87 Difference]: Start difference. First operand 159 states and 192 transitions. Second operand has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 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 10:55:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:14,021 INFO L93 Difference]: Finished difference Result 185 states and 224 transitions. [2022-10-16 10:55:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:55:14,022 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:55:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:14,023 INFO L225 Difference]: With dead ends: 185 [2022-10-16 10:55:14,023 INFO L226 Difference]: Without dead ends: 184 [2022-10-16 10:55:14,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=136, Invalid=419, Unknown=1, NotChecked=44, Total=600 [2022-10-16 10:55:14,025 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:14,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 222 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 89 Unchecked, 0.1s Time] [2022-10-16 10:55:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-16 10:55:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 175. [2022-10-16 10:55:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 165 states have (on average 1.290909090909091) internal successors, (213), 174 states have internal predecessors, (213), 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 10:55:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 213 transitions. [2022-10-16 10:55:14,042 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 213 transitions. Word has length 41 [2022-10-16 10:55:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:14,043 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 213 transitions. [2022-10-16 10:55:14,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 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 10:55:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 213 transitions. [2022-10-16 10:55:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 10:55:14,044 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:14,044 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:14,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:14,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:14,257 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:14,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1672749764, now seen corresponding path program 1 times [2022-10-16 10:55:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:14,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26076764] [2022-10-16 10:55:14,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:55:14,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:14,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26076764] [2022-10-16 10:55:14,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26076764] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:14,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436925560] [2022-10-16 10:55:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:14,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:14,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:14,472 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:14,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 10:55:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:14,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 10:55:14,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:14,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:55:14,602 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:55:14,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 31 [2022-10-16 10:55:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:55:14,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:55:14,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436925560] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:55:14,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:55:14,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-10-16 10:55:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591159423] [2022-10-16 10:55:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:55:14,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:55:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:14,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:55:14,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-16 10:55:14,627 INFO L87 Difference]: Start difference. First operand 175 states and 213 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:14,730 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2022-10-16 10:55:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 10:55:14,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-10-16 10:55:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:14,733 INFO L225 Difference]: With dead ends: 175 [2022-10-16 10:55:14,733 INFO L226 Difference]: Without dead ends: 174 [2022-10-16 10:55:14,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:55:14,735 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 75 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 10:55:14,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 75 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:55:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-10-16 10:55:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-10-16 10:55:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 165 states have (on average 1.2606060606060605) internal successors, (208), 173 states have internal predecessors, (208), 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 10:55:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2022-10-16 10:55:14,751 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 42 [2022-10-16 10:55:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:14,752 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2022-10-16 10:55:14,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2022-10-16 10:55:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 10:55:14,753 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:14,753 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:14,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:14,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-10-16 10:55:14,966 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1687435661, now seen corresponding path program 5 times [2022-10-16 10:55:14,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:14,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150946683] [2022-10-16 10:55:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:14,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:15,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:15,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150946683] [2022-10-16 10:55:15,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150946683] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:15,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094154510] [2022-10-16 10:55:15,283 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:55:15,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:15,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:15,288 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:15,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-16 10:55:15,404 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:55:15,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:15,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:55:15,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:15,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:15,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094154510] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:15,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:15,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2022-10-16 10:55:15,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139414234] [2022-10-16 10:55:15,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:15,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 10:55:15,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:15,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 10:55:15,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:55:15,874 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 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 10:55:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:16,482 INFO L93 Difference]: Finished difference Result 330 states and 395 transitions. [2022-10-16 10:55:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:55:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 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) Word has length 43 [2022-10-16 10:55:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:16,484 INFO L225 Difference]: With dead ends: 330 [2022-10-16 10:55:16,484 INFO L226 Difference]: Without dead ends: 255 [2022-10-16 10:55:16,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:55:16,487 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 190 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:16,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 339 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:55:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-10-16 10:55:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 218. [2022-10-16 10:55:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 209 states have (on average 1.2344497607655502) internal successors, (258), 217 states have internal predecessors, (258), 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 10:55:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2022-10-16 10:55:16,507 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 258 transitions. Word has length 43 [2022-10-16 10:55:16,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:16,507 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 258 transitions. [2022-10-16 10:55:16,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 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 10:55:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 258 transitions. [2022-10-16 10:55:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 10:55:16,508 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:16,509 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:16,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:16,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:16,723 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:16,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1194758214, now seen corresponding path program 1 times [2022-10-16 10:55:16,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:16,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740018461] [2022-10-16 10:55:16,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:16,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:55:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:16,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740018461] [2022-10-16 10:55:16,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740018461] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:16,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242995941] [2022-10-16 10:55:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:16,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:16,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:16,816 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:16,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-16 10:55:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:16,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:55:16,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:55:16,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:55:16,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242995941] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:16,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:16,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:55:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777166730] [2022-10-16 10:55:16,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:16,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:55:16,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:55:16,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:55:16,982 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 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 10:55:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:17,174 INFO L93 Difference]: Finished difference Result 292 states and 351 transitions. [2022-10-16 10:55:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:55:17,175 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 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 44 [2022-10-16 10:55:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:17,177 INFO L225 Difference]: With dead ends: 292 [2022-10-16 10:55:17,177 INFO L226 Difference]: Without dead ends: 291 [2022-10-16 10:55:17,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:55:17,179 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 112 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:17,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 188 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:55:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-10-16 10:55:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 266. [2022-10-16 10:55:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 257 states have (on average 1.2879377431906616) internal successors, (331), 265 states have internal predecessors, (331), 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 10:55:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 331 transitions. [2022-10-16 10:55:17,229 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 331 transitions. Word has length 44 [2022-10-16 10:55:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:17,230 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 331 transitions. [2022-10-16 10:55:17,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 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 10:55:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 331 transitions. [2022-10-16 10:55:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 10:55:17,231 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:17,232 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:17,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:17,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:17,447 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1617200910, now seen corresponding path program 1 times [2022-10-16 10:55:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:17,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825702350] [2022-10-16 10:55:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:55:17,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:17,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825702350] [2022-10-16 10:55:17,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825702350] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:17,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465621739] [2022-10-16 10:55:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:17,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:17,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:17,553 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:17,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-10-16 10:55:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:17,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:55:17,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:55:17,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:55:17,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465621739] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:55:17,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:55:17,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:55:17,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189029718] [2022-10-16 10:55:17,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:55:17,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:55:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:17,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:55:17,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:55:17,669 INFO L87 Difference]: Start difference. First operand 266 states and 331 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:17,755 INFO L93 Difference]: Finished difference Result 268 states and 331 transitions. [2022-10-16 10:55:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:55:17,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-10-16 10:55:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:17,758 INFO L225 Difference]: With dead ends: 268 [2022-10-16 10:55:17,758 INFO L226 Difference]: Without dead ends: 267 [2022-10-16 10:55:17,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:55:17,759 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:17,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:55:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-10-16 10:55:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-10-16 10:55:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 264 states have internal predecessors, (321), 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 10:55:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 321 transitions. [2022-10-16 10:55:17,781 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 321 transitions. Word has length 45 [2022-10-16 10:55:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:17,781 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 321 transitions. [2022-10-16 10:55:17,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 321 transitions. [2022-10-16 10:55:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:55:17,782 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:17,783 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:17,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:17,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:17,997 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:17,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash 411246071, now seen corresponding path program 6 times [2022-10-16 10:55:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:17,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155640135] [2022-10-16 10:55:17,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:18,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155640135] [2022-10-16 10:55:18,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155640135] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:18,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836380106] [2022-10-16 10:55:18,982 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:55:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:18,983 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:19,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-10-16 10:55:19,091 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-10-16 10:55:19,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:19,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-16 10:55:19,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:19,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:55:19,335 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:19,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:19,426 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:19,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:19,528 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:19,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:19,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:19,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 14 [2022-10-16 10:55:19,940 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 20 treesize of output 16 [2022-10-16 10:55:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:19,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836380106] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:19,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:19,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 42 [2022-10-16 10:55:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147304610] [2022-10-16 10:55:19,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:19,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-16 10:55:19,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:19,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-16 10:55:19,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2022-10-16 10:55:19,996 INFO L87 Difference]: Start difference. First operand 265 states and 321 transitions. Second operand has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 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 10:55:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:21,254 INFO L93 Difference]: Finished difference Result 343 states and 418 transitions. [2022-10-16 10:55:21,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:55:21,255 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-10-16 10:55:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:21,257 INFO L225 Difference]: With dead ends: 343 [2022-10-16 10:55:21,257 INFO L226 Difference]: Without dead ends: 275 [2022-10-16 10:55:21,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=2511, Unknown=0, NotChecked=0, Total=2756 [2022-10-16 10:55:21,259 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:21,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 859 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 10:55:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-10-16 10:55:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-10-16 10:55:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 253 states have (on average 1.2411067193675889) internal successors, (314), 260 states have internal predecessors, (314), 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 10:55:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 314 transitions. [2022-10-16 10:55:21,280 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 314 transitions. Word has length 47 [2022-10-16 10:55:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:21,280 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 314 transitions. [2022-10-16 10:55:21,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 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 10:55:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 314 transitions. [2022-10-16 10:55:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-16 10:55:21,281 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:21,281 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:21,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-10-16 10:55:21,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-10-16 10:55:21,496 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash 377560238, now seen corresponding path program 1 times [2022-10-16 10:55:21,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:21,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691895352] [2022-10-16 10:55:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:21,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-16 10:55:21,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:21,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691895352] [2022-10-16 10:55:21,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691895352] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:21,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483405628] [2022-10-16 10:55:21,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:21,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:21,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:21,588 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:21,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-10-16 10:55:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:21,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 10:55:21,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:55:21,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:55:21,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483405628] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:21,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:21,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 24 [2022-10-16 10:55:21,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742812981] [2022-10-16 10:55:21,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:21,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 10:55:21,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:21,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 10:55:21,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-10-16 10:55:21,986 INFO L87 Difference]: Start difference. First operand 261 states and 314 transitions. Second operand has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:22,578 INFO L93 Difference]: Finished difference Result 571 states and 679 transitions. [2022-10-16 10:55:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:55:22,578 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-10-16 10:55:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:22,581 INFO L225 Difference]: With dead ends: 571 [2022-10-16 10:55:22,582 INFO L226 Difference]: Without dead ends: 564 [2022-10-16 10:55:22,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=508, Invalid=1748, Unknown=0, NotChecked=0, Total=2256 [2022-10-16 10:55:22,584 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 531 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:22,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 314 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:55:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-10-16 10:55:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 339. [2022-10-16 10:55:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 331 states have (on average 1.2356495468277946) internal successors, (409), 338 states have internal predecessors, (409), 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 10:55:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 409 transitions. [2022-10-16 10:55:22,615 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 409 transitions. Word has length 49 [2022-10-16 10:55:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:22,616 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 409 transitions. [2022-10-16 10:55:22,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:55:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 409 transitions. [2022-10-16 10:55:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 10:55:22,617 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:22,617 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:22,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-10-16 10:55:22,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-16 10:55:22,832 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 522181700, now seen corresponding path program 4 times [2022-10-16 10:55:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:22,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642353301] [2022-10-16 10:55:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:22,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:55:22,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318830959] [2022-10-16 10:55:22,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:55:22,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:22,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:22,850 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:22,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-10-16 10:55:22,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:55:22,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:22,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:55:22,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:23,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 37 treesize of output 17 [2022-10-16 10:55:23,227 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:23,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:23,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:55:23,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:55:23,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-10-16 10:55:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:55:23,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:23,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6)) is different from false [2022-10-16 10:55:23,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:55:23,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6)) is different from false [2022-10-16 10:55:23,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)))) is different from false [2022-10-16 10:55:23,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:55:27,414 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:55:27,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:55:27,422 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:55:27,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:55:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 22 not checked. [2022-10-16 10:55:27,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:27,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642353301] [2022-10-16 10:55:27,563 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:55:27,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318830959] [2022-10-16 10:55:27,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318830959] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:27,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:55:27,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-10-16 10:55:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024021531] [2022-10-16 10:55:27,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:27,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 10:55:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:27,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 10:55:27,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=539, Unknown=21, NotChecked=260, Total=930 [2022-10-16 10:55:27,567 INFO L87 Difference]: Start difference. First operand 339 states and 409 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 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 10:55:30,540 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= 6 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-10-16 10:55:32,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 6) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)))) (<= 1 |c_ULTIMATE.start_main_#t~post7#1|))) is different from false [2022-10-16 10:55:33,900 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 6) (forall ((v_ArrVal_800 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from false [2022-10-16 10:55:35,915 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 6) (forall ((v_ArrVal_800 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)))))) is different from false [2022-10-16 10:55:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:36,350 INFO L93 Difference]: Finished difference Result 525 states and 651 transitions. [2022-10-16 10:55:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-16 10:55:36,351 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 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 52 [2022-10-16 10:55:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:36,354 INFO L225 Difference]: With dead ends: 525 [2022-10-16 10:55:36,354 INFO L226 Difference]: Without dead ends: 456 [2022-10-16 10:55:36,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=167, Invalid=833, Unknown=28, NotChecked=612, Total=1640 [2022-10-16 10:55:36,356 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 93 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 501 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:36,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 379 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 524 Invalid, 0 Unknown, 501 Unchecked, 0.4s Time] [2022-10-16 10:55:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-10-16 10:55:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 363. [2022-10-16 10:55:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 355 states have (on average 1.2253521126760563) internal successors, (435), 362 states have internal predecessors, (435), 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 10:55:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 435 transitions. [2022-10-16 10:55:36,392 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 435 transitions. Word has length 52 [2022-10-16 10:55:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:36,392 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 435 transitions. [2022-10-16 10:55:36,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 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 10:55:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 435 transitions. [2022-10-16 10:55:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-16 10:55:36,394 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:36,394 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:36,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:36,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-10-16 10:55:36,608 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash 819079367, now seen corresponding path program 7 times [2022-10-16 10:55:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:36,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524945746] [2022-10-16 10:55:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:36,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:37,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:37,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524945746] [2022-10-16 10:55:37,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524945746] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:37,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607139015] [2022-10-16 10:55:37,022 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:55:37,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:37,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:37,023 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:37,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-10-16 10:55:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:37,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 10:55:37,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:37,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:37,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607139015] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:37,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:37,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2022-10-16 10:55:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384829207] [2022-10-16 10:55:37,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:37,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:55:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:37,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:55:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:55:37,839 INFO L87 Difference]: Start difference. First operand 363 states and 435 transitions. Second operand has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 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 10:55:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:38,834 INFO L93 Difference]: Finished difference Result 544 states and 648 transitions. [2022-10-16 10:55:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-16 10:55:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 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 54 [2022-10-16 10:55:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:38,838 INFO L225 Difference]: With dead ends: 544 [2022-10-16 10:55:38,838 INFO L226 Difference]: Without dead ends: 458 [2022-10-16 10:55:38,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 78 SyntacticMatches, 17 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=599, Invalid=3183, Unknown=0, NotChecked=0, Total=3782 [2022-10-16 10:55:38,842 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 294 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:38,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 326 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:55:38,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-10-16 10:55:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 386. [2022-10-16 10:55:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 378 states have (on average 1.216931216931217) internal successors, (460), 385 states have internal predecessors, (460), 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 10:55:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 460 transitions. [2022-10-16 10:55:38,881 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 460 transitions. Word has length 54 [2022-10-16 10:55:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:38,882 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 460 transitions. [2022-10-16 10:55:38,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 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 10:55:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 460 transitions. [2022-10-16 10:55:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 10:55:38,890 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:38,890 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:38,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:39,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:39,102 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:39,102 INFO L85 PathProgramCache]: Analyzing trace with hash -878456120, now seen corresponding path program 5 times [2022-10-16 10:55:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:39,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564816159] [2022-10-16 10:55:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:39,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:55:39,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844513116] [2022-10-16 10:55:39,120 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:55:39,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:39,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:39,121 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:39,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-10-16 10:55:39,308 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:55:39,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:39,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-16 10:55:39,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:55:39,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:55:39,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:39,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564816159] [2022-10-16 10:55:39,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:55:39,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844513116] [2022-10-16 10:55:39,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844513116] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:39,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:55:39,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-10-16 10:55:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639781932] [2022-10-16 10:55:39,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:39,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 10:55:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:39,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 10:55:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-10-16 10:55:39,794 INFO L87 Difference]: Start difference. First operand 386 states and 460 transitions. Second operand has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 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 10:55:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:40,521 INFO L93 Difference]: Finished difference Result 482 states and 560 transitions. [2022-10-16 10:55:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:55:40,522 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 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 55 [2022-10-16 10:55:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:40,524 INFO L225 Difference]: With dead ends: 482 [2022-10-16 10:55:40,525 INFO L226 Difference]: Without dead ends: 400 [2022-10-16 10:55:40,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=371, Invalid=1699, Unknown=0, NotChecked=0, Total=2070 [2022-10-16 10:55:40,527 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 218 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:40,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 297 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:55:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-10-16 10:55:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 396. [2022-10-16 10:55:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 388 states have (on average 1.208762886597938) internal successors, (469), 395 states have internal predecessors, (469), 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 10:55:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 469 transitions. [2022-10-16 10:55:40,567 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 469 transitions. Word has length 55 [2022-10-16 10:55:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:40,568 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 469 transitions. [2022-10-16 10:55:40,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 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 10:55:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 469 transitions. [2022-10-16 10:55:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 10:55:40,569 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:40,569 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:40,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:40,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:40,784 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash -970475837, now seen corresponding path program 8 times [2022-10-16 10:55:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:40,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578194747] [2022-10-16 10:55:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:41,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:41,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578194747] [2022-10-16 10:55:41,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578194747] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:41,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11083666] [2022-10-16 10:55:41,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:55:41,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:41,912 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:41,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-10-16 10:55:42,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:55:42,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:42,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 10:55:42,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:42,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:55:42,145 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:42,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:42,213 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:42,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:42,319 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:42,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:42,427 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:42,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:42,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:42,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 14 [2022-10-16 10:55:42,690 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 20 treesize of output 16 [2022-10-16 10:55:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:42,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11083666] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:42,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:42,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 32 [2022-10-16 10:55:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532793372] [2022-10-16 10:55:42,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:42,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:55:42,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:42,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:55:42,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:55:42,753 INFO L87 Difference]: Start difference. First operand 396 states and 469 transitions. Second operand has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 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 10:55:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:44,110 INFO L93 Difference]: Finished difference Result 541 states and 660 transitions. [2022-10-16 10:55:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 10:55:44,115 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 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 58 [2022-10-16 10:55:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:44,118 INFO L225 Difference]: With dead ends: 541 [2022-10-16 10:55:44,118 INFO L226 Difference]: Without dead ends: 423 [2022-10-16 10:55:44,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:55:44,120 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 85 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:44,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 826 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-16 10:55:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-10-16 10:55:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 398. [2022-10-16 10:55:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 390 states have (on average 1.2076923076923076) internal successors, (471), 397 states have internal predecessors, (471), 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 10:55:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 471 transitions. [2022-10-16 10:55:44,161 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 471 transitions. Word has length 58 [2022-10-16 10:55:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:44,162 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 471 transitions. [2022-10-16 10:55:44,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 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 10:55:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 471 transitions. [2022-10-16 10:55:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-16 10:55:44,163 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:44,163 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:44,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-10-16 10:55:44,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-10-16 10:55:44,377 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1085736359, now seen corresponding path program 6 times [2022-10-16 10:55:44,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:44,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637317417] [2022-10-16 10:55:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:44,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:55:44,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881193976] [2022-10-16 10:55:44,397 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:55:44,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:44,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:44,399 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:44,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-10-16 10:55:44,638 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-10-16 10:55:44,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:44,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 49 conjunts are in the unsatisfiable core [2022-10-16 10:55:44,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:44,651 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 10 treesize of output 8 [2022-10-16 10:55:45,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:55:45,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:55:45,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:55:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:55:45,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:45,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:55:45,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) is different from false [2022-10-16 10:55:45,907 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:55:45,929 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:55:46,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:55:46,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-10-16 10:55:46,318 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:55:46,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:55:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 11 not checked. [2022-10-16 10:55:46,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637317417] [2022-10-16 10:55:46,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:55:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881193976] [2022-10-16 10:55:46,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881193976] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:46,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:55:46,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 40 [2022-10-16 10:55:46,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47975218] [2022-10-16 10:55:46,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:46,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:55:46,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:46,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:55:46,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1116, Unknown=7, NotChecked=284, Total=1560 [2022-10-16 10:55:46,661 INFO L87 Difference]: Start difference. First operand 398 states and 471 transitions. Second operand has 40 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 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 10:55:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:48,246 INFO L93 Difference]: Finished difference Result 400 states and 471 transitions. [2022-10-16 10:55:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-10-16 10:55:48,247 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 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 59 [2022-10-16 10:55:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:48,248 INFO L225 Difference]: With dead ends: 400 [2022-10-16 10:55:48,249 INFO L226 Difference]: Without dead ends: 356 [2022-10-16 10:55:48,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=431, Invalid=2883, Unknown=8, NotChecked=460, Total=3782 [2022-10-16 10:55:48,251 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 127 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 913 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:48,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 415 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 498 Invalid, 0 Unknown, 913 Unchecked, 0.3s Time] [2022-10-16 10:55:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-10-16 10:55:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-10-16 10:55:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 348 states have (on average 1.2270114942528736) internal successors, (427), 355 states have internal predecessors, (427), 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 10:55:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 427 transitions. [2022-10-16 10:55:48,283 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 427 transitions. Word has length 59 [2022-10-16 10:55:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:48,283 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 427 transitions. [2022-10-16 10:55:48,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 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 10:55:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 427 transitions. [2022-10-16 10:55:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 10:55:48,284 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:48,284 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:48,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:48,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-10-16 10:55:48,489 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:48,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2026433844, now seen corresponding path program 2 times [2022-10-16 10:55:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:48,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387245337] [2022-10-16 10:55:48,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:48,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:55:48,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:48,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387245337] [2022-10-16 10:55:48,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387245337] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:48,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887746542] [2022-10-16 10:55:48,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:55:48,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:48,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:48,683 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:48,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-10-16 10:55:48,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:55:48,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:48,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:55:48,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-16 10:55:48,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-16 10:55:48,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887746542] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:48,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:48,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:55:48,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948805259] [2022-10-16 10:55:48,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:48,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:55:48,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:48,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:55:48,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:55:48,971 INFO L87 Difference]: Start difference. First operand 356 states and 427 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 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 10:55:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:49,288 INFO L93 Difference]: Finished difference Result 374 states and 447 transitions. [2022-10-16 10:55:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:55:49,289 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 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 61 [2022-10-16 10:55:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:49,291 INFO L225 Difference]: With dead ends: 374 [2022-10-16 10:55:49,295 INFO L226 Difference]: Without dead ends: 373 [2022-10-16 10:55:49,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:55:49,297 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 139 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:49,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 148 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:55:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-10-16 10:55:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 355. [2022-10-16 10:55:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 348 states have (on average 1.2155172413793103) internal successors, (423), 354 states have internal predecessors, (423), 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 10:55:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 423 transitions. [2022-10-16 10:55:49,346 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 423 transitions. Word has length 61 [2022-10-16 10:55:49,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:49,346 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 423 transitions. [2022-10-16 10:55:49,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 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 10:55:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 423 transitions. [2022-10-16 10:55:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-16 10:55:49,347 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:49,348 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:49,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:49,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:49,561 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:49,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1574972464, now seen corresponding path program 7 times [2022-10-16 10:55:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:49,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654186486] [2022-10-16 10:55:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:49,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:55:49,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819769589] [2022-10-16 10:55:49,588 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:55:49,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:49,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:49,590 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:49,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-10-16 10:55:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:49,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-16 10:55:49,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-16 10:55:49,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-16 10:55:50,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:50,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654186486] [2022-10-16 10:55:50,076 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:55:50,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819769589] [2022-10-16 10:55:50,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819769589] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:50,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:55:50,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-10-16 10:55:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793596907] [2022-10-16 10:55:50,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:50,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 10:55:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:50,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 10:55:50,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-10-16 10:55:50,078 INFO L87 Difference]: Start difference. First operand 355 states and 423 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 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 10:55:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:50,626 INFO L93 Difference]: Finished difference Result 446 states and 534 transitions. [2022-10-16 10:55:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:55:50,627 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 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 63 [2022-10-16 10:55:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:50,629 INFO L225 Difference]: With dead ends: 446 [2022-10-16 10:55:50,629 INFO L226 Difference]: Without dead ends: 323 [2022-10-16 10:55:50,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:55:50,637 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 199 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:50,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 252 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:55:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-10-16 10:55:50,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2022-10-16 10:55:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 314 states have (on average 1.21656050955414) internal successors, (382), 320 states have internal predecessors, (382), 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 10:55:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 382 transitions. [2022-10-16 10:55:50,668 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 382 transitions. Word has length 63 [2022-10-16 10:55:50,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:50,669 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 382 transitions. [2022-10-16 10:55:50,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 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 10:55:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 382 transitions. [2022-10-16 10:55:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 10:55:50,670 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:50,671 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:50,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:50,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:50,884 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:50,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash 482497147, now seen corresponding path program 9 times [2022-10-16 10:55:50,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:50,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699292926] [2022-10-16 10:55:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 51 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:51,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:51,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699292926] [2022-10-16 10:55:51,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699292926] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:51,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078282835] [2022-10-16 10:55:51,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:55:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:51,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:51,504 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:51,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-10-16 10:55:51,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 10:55:51,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:51,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 10:55:51,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 80 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:52,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 80 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:52,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078282835] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:52,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:52,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2022-10-16 10:55:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479166603] [2022-10-16 10:55:52,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:52,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:55:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:52,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:55:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2022-10-16 10:55:52,739 INFO L87 Difference]: Start difference. First operand 321 states and 382 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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 10:55:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:53,883 INFO L93 Difference]: Finished difference Result 508 states and 604 transitions. [2022-10-16 10:55:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-16 10:55:53,884 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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 65 [2022-10-16 10:55:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:53,886 INFO L225 Difference]: With dead ends: 508 [2022-10-16 10:55:53,886 INFO L226 Difference]: Without dead ends: 423 [2022-10-16 10:55:53,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 94 SyntacticMatches, 21 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=702, Invalid=3854, Unknown=0, NotChecked=0, Total=4556 [2022-10-16 10:55:53,889 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 375 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:53,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 377 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:55:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-10-16 10:55:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 358. [2022-10-16 10:55:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 351 states have (on average 1.1965811965811965) internal successors, (420), 357 states have internal predecessors, (420), 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 10:55:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 420 transitions. [2022-10-16 10:55:53,921 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 420 transitions. Word has length 65 [2022-10-16 10:55:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:53,922 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 420 transitions. [2022-10-16 10:55:53,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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 10:55:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 420 transitions. [2022-10-16 10:55:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-16 10:55:53,923 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:53,923 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:53,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-10-16 10:55:54,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:54,124 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:54,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1153339649, now seen corresponding path program 10 times [2022-10-16 10:55:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:54,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364413026] [2022-10-16 10:55:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:55:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:55:55,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364413026] [2022-10-16 10:55:55,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364413026] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:55:55,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297213740] [2022-10-16 10:55:55,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:55:55,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:55,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:55,600 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:55,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-10-16 10:55:55,728 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:55:55,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:55,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-16 10:55:55,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:55,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:55:55,863 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:55,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:55,934 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:55,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:56,053 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:56,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:56,172 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:56,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:56,293 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:56,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:56,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:56,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 14 [2022-10-16 10:55:56,619 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 20 treesize of output 16 [2022-10-16 10:55:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:55:56,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297213740] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:55:56,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:55:56,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 38 [2022-10-16 10:55:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179364577] [2022-10-16 10:55:56,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:55:56,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-16 10:55:56,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:55:56,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-16 10:55:56,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:55:56,704 INFO L87 Difference]: Start difference. First operand 358 states and 420 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 10:55:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:55:58,517 INFO L93 Difference]: Finished difference Result 516 states and 624 transitions. [2022-10-16 10:55:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:55:58,518 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 69 [2022-10-16 10:55:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:55:58,520 INFO L225 Difference]: With dead ends: 516 [2022-10-16 10:55:58,520 INFO L226 Difference]: Without dead ends: 399 [2022-10-16 10:55:58,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2022-10-16 10:55:58,522 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 113 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:55:58,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1024 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-10-16 10:55:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-10-16 10:55:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 372. [2022-10-16 10:55:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 365 states have (on average 1.1945205479452055) internal successors, (436), 371 states have internal predecessors, (436), 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 10:55:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 436 transitions. [2022-10-16 10:55:58,550 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 436 transitions. Word has length 69 [2022-10-16 10:55:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:55:58,551 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 436 transitions. [2022-10-16 10:55:58,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 10:55:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 436 transitions. [2022-10-16 10:55:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 10:55:58,552 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:55:58,552 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:55:58,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-10-16 10:55:58,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-10-16 10:55:58,765 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:55:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:55:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1198011565, now seen corresponding path program 8 times [2022-10-16 10:55:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:55:58,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608222914] [2022-10-16 10:55:58,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:55:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:55:58,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:55:58,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629575178] [2022-10-16 10:55:58,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:55:58,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:55:58,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:55:58,784 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:55:58,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-10-16 10:55:58,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:55:58,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:55:58,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 47 conjunts are in the unsatisfiable core [2022-10-16 10:55:58,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:55:58,923 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 10 treesize of output 8 [2022-10-16 10:55:59,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:55:59,214 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:55:59,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:55:59,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:55:59,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:55:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:55:59,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:55:59,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:55:59,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) is different from false [2022-10-16 10:55:59,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:55:59,629 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) is different from false [2022-10-16 10:55:59,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) is different from false [2022-10-16 10:55:59,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)))) is different from false [2022-10-16 10:55:59,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:56:01,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 5 |c_ULTIMATE.start_main_#t~mem9#1|)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:56:03,480 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:56:03,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:56:03,489 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:56:03,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:56:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 46 not checked. [2022-10-16 10:56:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:03,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608222914] [2022-10-16 10:56:03,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:56:03,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629575178] [2022-10-16 10:56:03,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629575178] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:56:03,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:56:03,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2022-10-16 10:56:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759770248] [2022-10-16 10:56:03,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:56:03,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:56:03,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:03,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:56:03,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=571, Unknown=8, NotChecked=440, Total=1122 [2022-10-16 10:56:03,582 INFO L87 Difference]: Start difference. First operand 372 states and 436 transitions. Second operand has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 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 10:56:04,509 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 6 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= 2 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:56:06,514 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6)) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)))) (= (select .cse0 .cse1) 6))) is different from false [2022-10-16 10:56:07,289 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 6)) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 (+ 5 |c_ULTIMATE.start_main_#t~mem9#1|)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select .cse0 .cse2) 6))) is different from false [2022-10-16 10:56:08,036 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse1) 6))) is different from false [2022-10-16 10:56:10,040 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 6)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 6)) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)))) (= (select .cse1 .cse0) 6))) is different from false [2022-10-16 10:56:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:10,634 INFO L93 Difference]: Finished difference Result 513 states and 607 transitions. [2022-10-16 10:56:10,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-16 10:56:10,635 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 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 70 [2022-10-16 10:56:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:10,637 INFO L225 Difference]: With dead ends: 513 [2022-10-16 10:56:10,637 INFO L226 Difference]: Without dead ends: 462 [2022-10-16 10:56:10,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 106 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=170, Invalid=991, Unknown=13, NotChecked=988, Total=2162 [2022-10-16 10:56:10,639 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 87 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 747 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:10,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 550 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 802 Invalid, 0 Unknown, 747 Unchecked, 0.5s Time] [2022-10-16 10:56:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-10-16 10:56:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 406. [2022-10-16 10:56:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 399 states have (on average 1.1854636591478698) internal successors, (473), 405 states have internal predecessors, (473), 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 10:56:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 473 transitions. [2022-10-16 10:56:10,676 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 473 transitions. Word has length 70 [2022-10-16 10:56:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:10,676 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 473 transitions. [2022-10-16 10:56:10,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 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 10:56:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 473 transitions. [2022-10-16 10:56:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-16 10:56:10,678 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:10,678 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:10,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-10-16 10:56:10,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-10-16 10:56:10,886 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:56:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1968023236, now seen corresponding path program 9 times [2022-10-16 10:56:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:10,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077588639] [2022-10-16 10:56:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:10,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:56:10,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559590163] [2022-10-16 10:56:10,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:56:10,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:10,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:10,911 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:56:10,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-10-16 10:56:11,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 10:56:11,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:56:11,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 72 conjunts are in the unsatisfiable core [2022-10-16 10:56:11,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:56:11,156 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 10 treesize of output 8 [2022-10-16 10:56:11,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:56:11,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-10-16 10:56:11,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-10-16 10:56:12,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-10-16 10:56:12,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-10-16 10:56:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 32 proven. 89 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:56:12,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:56:13,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1358) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:56:13,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1358) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6)) is different from false [2022-10-16 10:56:15,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:56:15,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 70 [2022-10-16 10:56:15,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:56:15,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:56:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-10-16 10:56:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:15,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077588639] [2022-10-16 10:56:15,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:56:15,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559590163] [2022-10-16 10:56:15,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559590163] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:56:15,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:56:15,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 57 [2022-10-16 10:56:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354906775] [2022-10-16 10:56:15,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:56:15,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-16 10:56:15,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:15,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-16 10:56:15,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2759, Unknown=2, NotChecked=214, Total=3192 [2022-10-16 10:56:15,530 INFO L87 Difference]: Start difference. First operand 406 states and 473 transitions. Second operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 57 states have internal predecessors, (118), 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 10:56:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:27,218 INFO L93 Difference]: Finished difference Result 461 states and 540 transitions. [2022-10-16 10:56:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-10-16 10:56:27,219 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 57 states have internal predecessors, (118), 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 74 [2022-10-16 10:56:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:27,221 INFO L225 Difference]: With dead ends: 461 [2022-10-16 10:56:27,221 INFO L226 Difference]: Without dead ends: 426 [2022-10-16 10:56:27,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=858, Invalid=7700, Unknown=6, NotChecked=366, Total=8930 [2022-10-16 10:56:27,224 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 122 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1099 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:27,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 755 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1052 Invalid, 0 Unknown, 1099 Unchecked, 0.6s Time] [2022-10-16 10:56:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-10-16 10:56:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 399. [2022-10-16 10:56:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 392 states have (on average 1.1887755102040816) internal successors, (466), 398 states have internal predecessors, (466), 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 10:56:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 466 transitions. [2022-10-16 10:56:27,266 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 466 transitions. Word has length 74 [2022-10-16 10:56:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:27,267 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 466 transitions. [2022-10-16 10:56:27,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 57 states have internal predecessors, (118), 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 10:56:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 466 transitions. [2022-10-16 10:56:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 10:56:27,268 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:27,268 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:27,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-10-16 10:56:27,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-10-16 10:56:27,482 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:56:27,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash 445652671, now seen corresponding path program 11 times [2022-10-16 10:56:27,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:27,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415991522] [2022-10-16 10:56:27,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 81 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:56:28,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:28,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415991522] [2022-10-16 10:56:28,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415991522] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:56:28,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771030295] [2022-10-16 10:56:28,340 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:56:28,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:28,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:28,342 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:56:28,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-10-16 10:56:28,575 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-10-16 10:56:28,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:56:28,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2022-10-16 10:56:28,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:56:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 117 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:56:29,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:56:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 117 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:56:30,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771030295] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:56:30,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:56:30,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2022-10-16 10:56:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030592792] [2022-10-16 10:56:30,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:56:30,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-16 10:56:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-16 10:56:30,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1784, Unknown=0, NotChecked=0, Total=2070 [2022-10-16 10:56:30,211 INFO L87 Difference]: Start difference. First operand 399 states and 466 transitions. Second operand has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 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 10:56:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:32,594 INFO L93 Difference]: Finished difference Result 618 states and 722 transitions. [2022-10-16 10:56:32,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-10-16 10:56:32,595 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 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 76 [2022-10-16 10:56:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:32,598 INFO L225 Difference]: With dead ends: 618 [2022-10-16 10:56:32,598 INFO L226 Difference]: Without dead ends: 533 [2022-10-16 10:56:32,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 110 SyntacticMatches, 25 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3154 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1265, Invalid=7107, Unknown=0, NotChecked=0, Total=8372 [2022-10-16 10:56:32,601 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 289 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:32,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 397 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 10:56:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-10-16 10:56:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 443. [2022-10-16 10:56:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 436 states have (on average 1.1743119266055047) internal successors, (512), 442 states have internal predecessors, (512), 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 10:56:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 512 transitions. [2022-10-16 10:56:32,648 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 512 transitions. Word has length 76 [2022-10-16 10:56:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:32,648 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 512 transitions. [2022-10-16 10:56:32,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 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 10:56:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 512 transitions. [2022-10-16 10:56:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 10:56:32,650 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:32,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:32,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-10-16 10:56:32,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-10-16 10:56:32,864 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:56:32,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash 952699344, now seen corresponding path program 10 times [2022-10-16 10:56:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:32,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033065721] [2022-10-16 10:56:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:32,882 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:56:32,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [328760588] [2022-10-16 10:56:32,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:56:32,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:32,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:32,884 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:56:32,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-10-16 10:56:33,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:56:33,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:56:33,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 46 conjunts are in the unsatisfiable core [2022-10-16 10:56:33,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:56:33,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-10-16 10:56:33,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:56:33,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:56:33,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:56:33,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:56:34,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:56:34,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:56:34,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-10-16 10:56:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:56:34,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:56:34,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6)) is different from false [2022-10-16 10:56:34,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:56:34,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:56:34,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:56:34,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) is different from false [2022-10-16 10:56:34,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) is different from false [2022-10-16 10:56:34,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 5 |c_ULTIMATE.start_main_#t~mem9#1|))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:56:34,549 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:56:34,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-10-16 10:56:34,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:56:34,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:56:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 46 not checked. [2022-10-16 10:56:34,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:34,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033065721] [2022-10-16 10:56:34,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:56:34,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328760588] [2022-10-16 10:56:34,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328760588] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:56:34,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:56:34,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2022-10-16 10:56:34,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945089344] [2022-10-16 10:56:34,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:56:34,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-16 10:56:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:34,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-16 10:56:34,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=994, Unknown=7, NotChecked=490, Total=1640 [2022-10-16 10:56:34,953 INFO L87 Difference]: Start difference. First operand 443 states and 512 transitions. Second operand has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 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 10:56:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:36,744 INFO L93 Difference]: Finished difference Result 565 states and 651 transitions. [2022-10-16 10:56:36,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-16 10:56:36,745 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 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 77 [2022-10-16 10:56:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:36,747 INFO L225 Difference]: With dead ends: 565 [2022-10-16 10:56:36,747 INFO L226 Difference]: Without dead ends: 532 [2022-10-16 10:56:36,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 113 SyntacticMatches, 12 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=238, Invalid=1589, Unknown=7, NotChecked=616, Total=2450 [2022-10-16 10:56:36,748 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 220 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 801 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:36,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 737 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1249 Invalid, 0 Unknown, 801 Unchecked, 0.8s Time] [2022-10-16 10:56:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-10-16 10:56:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 488. [2022-10-16 10:56:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 481 states have (on average 1.162162162162162) internal successors, (559), 487 states have internal predecessors, (559), 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 10:56:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 559 transitions. [2022-10-16 10:56:36,807 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 559 transitions. Word has length 77 [2022-10-16 10:56:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:36,807 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 559 transitions. [2022-10-16 10:56:36,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 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 10:56:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 559 transitions. [2022-10-16 10:56:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 10:56:36,812 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:36,813 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:36,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-10-16 10:56:37,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:37,027 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:56:37,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash 952699152, now seen corresponding path program 2 times [2022-10-16 10:56:37,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:37,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815962055] [2022-10-16 10:56:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:37,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-16 10:56:37,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:37,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815962055] [2022-10-16 10:56:37,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815962055] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:56:37,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980114140] [2022-10-16 10:56:37,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:56:37,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:37,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:37,974 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:56:37,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-10-16 10:56:38,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:56:38,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:56:38,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-16 10:56:38,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:56:38,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:56:38,124 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 10 treesize of output 8 [2022-10-16 10:56:38,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:56:38,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:56:38,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:56:38,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:56:38,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:56:38,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:56:38,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:56:38,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:56:38,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-10-16 10:56:38,760 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:56:38,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2022-10-16 10:56:39,067 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-10-16 10:56:39,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 61 [2022-10-16 10:56:39,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:56:39,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 98 [2022-10-16 10:56:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-10-16 10:56:39,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:09,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_289| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_1553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_ArrVal_1556 Int) (v_ArrVal_1555 Int) (v_ArrVal_1558 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1553))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)))) (.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1556)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4)))) (.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1555)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_289| 4)))) (.cse3 (select v_ArrVal_1553 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (< 6 .cse0) (< 6 .cse1) (< (+ v_ArrVal_1558 .cse2) 9223372036854775808) (< 6 .cse2) (< (+ .cse0 v_ArrVal_1556) v_ArrVal_1558) (< (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1555) (< (+ .cse1 v_ArrVal_1555) v_ArrVal_1556) (< 6 .cse3)))))) is different from false [2022-10-16 10:57:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 28 refuted. 2 times theorem prover too weak. 61 trivial. 13 not checked. [2022-10-16 10:57:14,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980114140] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:14,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:14,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2022-10-16 10:57:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88064486] [2022-10-16 10:57:14,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:14,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:57:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:57:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1172, Unknown=14, NotChecked=74, Total=1560 [2022-10-16 10:57:14,759 INFO L87 Difference]: Start difference. First operand 488 states and 559 transitions. Second operand has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 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 10:57:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:37,690 INFO L93 Difference]: Finished difference Result 552 states and 644 transitions. [2022-10-16 10:57:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 10:57:37,690 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 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 77 [2022-10-16 10:57:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:37,692 INFO L225 Difference]: With dead ends: 552 [2022-10-16 10:57:37,692 INFO L226 Difference]: Without dead ends: 551 [2022-10-16 10:57:37,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 138 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=616, Invalid=2340, Unknown=18, NotChecked=106, Total=3080 [2022-10-16 10:57:37,693 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:37,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 376 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 167 Unchecked, 0.0s Time] [2022-10-16 10:57:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-10-16 10:57:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 544. [2022-10-16 10:57:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 537 states have (on average 1.175046554934823) internal successors, (631), 543 states have internal predecessors, (631), 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 10:57:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 631 transitions. [2022-10-16 10:57:37,754 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 631 transitions. Word has length 77 [2022-10-16 10:57:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:37,754 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 631 transitions. [2022-10-16 10:57:37,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 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 10:57:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 631 transitions. [2022-10-16 10:57:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-16 10:57:37,755 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:37,756 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:37,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-10-16 10:57:37,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-10-16 10:57:37,970 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:37,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash -917434056, now seen corresponding path program 11 times [2022-10-16 10:57:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:37,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281240978] [2022-10-16 10:57:37,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:37,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:37,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:57:37,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [567740749] [2022-10-16 10:57:37,987 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:57:37,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:37,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:37,988 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:37,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-10-16 10:57:38,179 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-10-16 10:57:38,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:38,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 10:57:38,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 45 proven. 96 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:38,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 45 proven. 96 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:39,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281240978] [2022-10-16 10:57:39,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:57:39,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567740749] [2022-10-16 10:57:39,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567740749] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:39,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:57:39,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2022-10-16 10:57:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032609874] [2022-10-16 10:57:39,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:39,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-10-16 10:57:39,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-10-16 10:57:39,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2022-10-16 10:57:39,235 INFO L87 Difference]: Start difference. First operand 544 states and 631 transitions. Second operand has 36 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 36 states have internal predecessors, (114), 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 10:57:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:40,366 INFO L93 Difference]: Finished difference Result 760 states and 898 transitions. [2022-10-16 10:57:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-16 10:57:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 36 states have internal predecessors, (114), 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 78 [2022-10-16 10:57:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:40,369 INFO L225 Difference]: With dead ends: 760 [2022-10-16 10:57:40,369 INFO L226 Difference]: Without dead ends: 551 [2022-10-16 10:57:40,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 108 SyntacticMatches, 12 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=486, Invalid=2594, Unknown=0, NotChecked=0, Total=3080 [2022-10-16 10:57:40,371 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 176 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:40,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 515 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 10:57:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-10-16 10:57:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 493. [2022-10-16 10:57:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 486 states have (on average 1.1707818930041152) internal successors, (569), 492 states have internal predecessors, (569), 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 10:57:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 569 transitions. [2022-10-16 10:57:40,420 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 569 transitions. Word has length 78 [2022-10-16 10:57:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:40,421 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 569 transitions. [2022-10-16 10:57:40,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 36 states have internal predecessors, (114), 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 10:57:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 569 transitions. [2022-10-16 10:57:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-16 10:57:40,422 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:40,422 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:40,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-10-16 10:57:40,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:40,628 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:40,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash 744540091, now seen corresponding path program 12 times [2022-10-16 10:57:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:40,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84842267] [2022-10-16 10:57:40,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:42,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:42,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84842267] [2022-10-16 10:57:42,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84842267] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:42,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050174714] [2022-10-16 10:57:42,473 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:57:42,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:42,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:42,475 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:42,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-10-16 10:57:42,915 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-10-16 10:57:42,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:42,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 73 conjunts are in the unsatisfiable core [2022-10-16 10:57:42,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:42,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:57:43,080 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:57:43,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:57:43,166 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:57:43,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:57:43,301 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:57:43,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:57:43,442 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:57:43,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:57:43,597 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:57:43,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:57:43,745 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:57:43,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:57:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:43,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:44,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 14 [2022-10-16 10:57:44,131 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 20 treesize of output 16 [2022-10-16 10:57:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:44,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050174714] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:44,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:44,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 44 [2022-10-16 10:57:44,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195533074] [2022-10-16 10:57:44,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:44,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-16 10:57:44,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:44,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-16 10:57:44,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1769, Unknown=0, NotChecked=0, Total=1892 [2022-10-16 10:57:44,226 INFO L87 Difference]: Start difference. First operand 493 states and 569 transitions. Second operand has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 states have internal predecessors, (128), 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 10:57:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:46,622 INFO L93 Difference]: Finished difference Result 646 states and 768 transitions. [2022-10-16 10:57:46,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:57:46,622 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 states have internal predecessors, (128), 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 80 [2022-10-16 10:57:46,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:46,625 INFO L225 Difference]: With dead ends: 646 [2022-10-16 10:57:46,625 INFO L226 Difference]: Without dead ends: 529 [2022-10-16 10:57:46,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 148 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=237, Invalid=3669, Unknown=0, NotChecked=0, Total=3906 [2022-10-16 10:57:46,626 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 134 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:46,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1177 Invalid, 2999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-10-16 10:57:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-10-16 10:57:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 507. [2022-10-16 10:57:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 500 states have (on average 1.17) internal successors, (585), 506 states have internal predecessors, (585), 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 10:57:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 585 transitions. [2022-10-16 10:57:46,682 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 585 transitions. Word has length 80 [2022-10-16 10:57:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:46,683 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 585 transitions. [2022-10-16 10:57:46,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 states have internal predecessors, (128), 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 10:57:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 585 transitions. [2022-10-16 10:57:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-16 10:57:46,684 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:46,684 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:46,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:46,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:46,899 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:46,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1987594419, now seen corresponding path program 12 times [2022-10-16 10:57:46,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:46,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083354794] [2022-10-16 10:57:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:46,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:46,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:57:46,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694580428] [2022-10-16 10:57:46,917 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:57:46,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:46,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:46,918 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:46,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-10-16 10:57:47,168 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-10-16 10:57:47,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:47,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 10:57:47,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 50 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:57:47,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 50 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:57:48,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:48,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083354794] [2022-10-16 10:57:48,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:57:48,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694580428] [2022-10-16 10:57:48,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694580428] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:48,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:57:48,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2022-10-16 10:57:48,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136461715] [2022-10-16 10:57:48,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:48,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 10:57:48,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:48,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 10:57:48,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2022-10-16 10:57:48,123 INFO L87 Difference]: Start difference. First operand 507 states and 585 transitions. Second operand has 30 states, 30 states have (on average 3.4) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:48,758 INFO L93 Difference]: Finished difference Result 544 states and 626 transitions. [2022-10-16 10:57:48,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-16 10:57:48,759 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.4) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-10-16 10:57:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:48,764 INFO L225 Difference]: With dead ends: 544 [2022-10-16 10:57:48,764 INFO L226 Difference]: Without dead ends: 455 [2022-10-16 10:57:48,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 128 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2022-10-16 10:57:48,766 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 127 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:48,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 326 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:57:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-10-16 10:57:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-10-16 10:57:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 446 states have (on average 1.1860986547085202) internal successors, (529), 452 states have internal predecessors, (529), 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 10:57:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 529 transitions. [2022-10-16 10:57:48,816 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 529 transitions. Word has length 84 [2022-10-16 10:57:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:48,817 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 529 transitions. [2022-10-16 10:57:48,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.4) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 529 transitions. [2022-10-16 10:57:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-10-16 10:57:48,818 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:48,818 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:48,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-10-16 10:57:49,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-10-16 10:57:49,030 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 757864824, now seen corresponding path program 13 times [2022-10-16 10:57:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:49,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947905540] [2022-10-16 10:57:49,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:49,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:49,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:57:49,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670793314] [2022-10-16 10:57:49,048 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:57:49,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:49,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:49,049 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:49,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-10-16 10:57:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:49,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 48 conjunts are in the unsatisfiable core [2022-10-16 10:57:49,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:49,202 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 10 treesize of output 8 [2022-10-16 10:57:49,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:57:49,464 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:57:49,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:57:49,568 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:57:49,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:57:49,671 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:57:49,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:57:49,793 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:57:49,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:57:49,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:57:49,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-10-16 10:57:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 39 proven. 74 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-10-16 10:57:49,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:50,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6)) is different from false [2022-10-16 10:57:50,106 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:57:50,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:57:50,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_344|)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6)))) is different from false [2022-10-16 10:57:50,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6))) is different from false [2022-10-16 10:57:50,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:57:50,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_345|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) is different from false [2022-10-16 10:57:50,342 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2022-10-16 10:57:50,370 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) is different from false [2022-10-16 10:57:50,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) is different from false [2022-10-16 10:57:50,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) is different from false [2022-10-16 10:57:50,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) is different from false [2022-10-16 10:57:50,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_347|)))) is different from false [2022-10-16 10:57:50,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6) (< |v_ULTIMATE.start_main_~i~0#1_347| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) is different from false [2022-10-16 10:57:50,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 5 |c_ULTIMATE.start_main_#t~mem9#1|)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6))) is different from false [2022-10-16 10:57:51,124 INFO L356 Elim1Store]: treesize reduction 364, result has 14.8 percent of original size [2022-10-16 10:57:51,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 79 [2022-10-16 10:57:51,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:57:51,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:57:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 111 not checked. [2022-10-16 10:57:51,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:51,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947905540] [2022-10-16 10:57:51,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:57:51,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670793314] [2022-10-16 10:57:51,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670793314] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:51,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:57:51,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 42 [2022-10-16 10:57:51,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315436540] [2022-10-16 10:57:51,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:51,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-16 10:57:51,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:51,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-16 10:57:51,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=611, Unknown=15, NotChecked=960, Total=1722 [2022-10-16 10:57:51,211 INFO L87 Difference]: Start difference. First operand 453 states and 529 transitions. Second operand has 42 states, 42 states have (on average 2.619047619047619) internal successors, (110), 42 states have internal predecessors, (110), 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 10:57:53,440 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 6 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6) (< |v_ULTIMATE.start_main_~i~0#1_347| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-10-16 10:57:55,446 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 6) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_347|)))) (<= 1 |c_ULTIMATE.start_main_#t~post7#1|))) is different from false [2022-10-16 10:57:57,454 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 6) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) is different from false [2022-10-16 10:57:58,945 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 6) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) is different from false [2022-10-16 10:58:00,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 6) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))))) is different from false [2022-10-16 10:58:03,017 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 6) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| .cse2) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (store .cse0 .cse3 (+ 5 |c_ULTIMATE.start_main_#t~mem9#1|)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6))) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| .cse2) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse3 v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))))) is different from false [2022-10-16 10:58:05,027 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (= (select .cse1 .cse2) 6) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 6) (< |v_ULTIMATE.start_main_~i~0#1_347| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))))) is different from false [2022-10-16 10:58:07,034 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (<= 3 |c_ULTIMATE.start_main_#t~post7#1|) (= (select .cse0 .cse1) 6) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_345|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_347|)))))) is different from false [2022-10-16 10:58:09,045 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 .cse1) 6) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| .cse2) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse3 v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse3 v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6) (< |v_ULTIMATE.start_main_~i~0#1_344| .cse2))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:58:11,056 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 6) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_346| .cse2) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| .cse2) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:58:13,064 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (= (select .cse0 .cse1) 6) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_344|)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6)))))) is different from false [2022-10-16 10:58:15,170 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 6) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (store .cse0 .cse2 (+ 5 |c_ULTIMATE.start_main_#t~mem9#1|)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6))) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| .cse3) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse2 v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))))) is different from false [2022-10-16 10:58:17,212 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (= (select .cse1 .cse2) 6) (forall ((v_ArrVal_1842 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 6) (< |v_ULTIMATE.start_main_~i~0#1_347| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:58:19,233 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (= (select .cse0 .cse1) 6) (forall ((v_ArrVal_1842 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_345|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_347|)))))) is different from false [2022-10-16 10:58:21,289 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 .cse1) 6) (forall ((v_ArrVal_1842 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| .cse2) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse3 v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse3 v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6) (< |v_ULTIMATE.start_main_~i~0#1_344| .cse2))))) is different from false [2022-10-16 10:58:23,354 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 .cse1) 6) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| .cse2) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse3 v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse3 v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6) (< |v_ULTIMATE.start_main_~i~0#1_344| .cse2))))) is different from false [2022-10-16 10:58:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:58:23,505 INFO L93 Difference]: Finished difference Result 676 states and 825 transitions. [2022-10-16 10:58:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:58:23,506 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.619047619047619) internal successors, (110), 42 states have internal predecessors, (110), 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 85 [2022-10-16 10:58:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:58:23,509 INFO L225 Difference]: With dead ends: 676 [2022-10-16 10:58:23,509 INFO L226 Difference]: Without dead ends: 607 [2022-10-16 10:58:23,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=205, Invalid=818, Unknown=31, NotChecked=2728, Total=3782 [2022-10-16 10:58:23,510 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 91 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1270 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:58:23,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 606 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 565 Invalid, 0 Unknown, 1270 Unchecked, 0.4s Time] [2022-10-16 10:58:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-10-16 10:58:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 523. [2022-10-16 10:58:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 516 states have (on average 1.199612403100775) internal successors, (619), 522 states have internal predecessors, (619), 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 10:58:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 619 transitions. [2022-10-16 10:58:23,567 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 619 transitions. Word has length 85 [2022-10-16 10:58:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:58:23,568 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 619 transitions. [2022-10-16 10:58:23,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.619047619047619) internal successors, (110), 42 states have internal predecessors, (110), 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 10:58:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 619 transitions. [2022-10-16 10:58:23,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 10:58:23,569 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:58:23,569 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:58:23,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-10-16 10:58:23,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-10-16 10:58:23,783 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:58:23,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:58:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1453671805, now seen corresponding path program 13 times [2022-10-16 10:58:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:58:23,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501565578] [2022-10-16 10:58:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:58:23,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:58:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:58:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 118 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:58:25,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:58:25,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501565578] [2022-10-16 10:58:25,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501565578] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:58:25,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788207278] [2022-10-16 10:58:25,067 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:58:25,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:58:25,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:58:25,071 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:58:25,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-10-16 10:58:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:58:25,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:58:25,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:58:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 161 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:58:26,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:58:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 161 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:58:27,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788207278] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:58:27,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:58:27,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2022-10-16 10:58:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343506541] [2022-10-16 10:58:27,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:58:27,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-10-16 10:58:27,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:58:27,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-10-16 10:58:27,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2295, Unknown=0, NotChecked=0, Total=2652 [2022-10-16 10:58:27,741 INFO L87 Difference]: Start difference. First operand 523 states and 619 transitions. Second operand has 52 states, 52 states have (on average 2.9038461538461537) internal successors, (151), 52 states have internal predecessors, (151), 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 10:58:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:58:31,566 INFO L93 Difference]: Finished difference Result 797 states and 945 transitions. [2022-10-16 10:58:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-10-16 10:58:31,568 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.9038461538461537) internal successors, (151), 52 states have internal predecessors, (151), 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 87 [2022-10-16 10:58:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:58:31,570 INFO L225 Difference]: With dead ends: 797 [2022-10-16 10:58:31,570 INFO L226 Difference]: Without dead ends: 649 [2022-10-16 10:58:31,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 126 SyntacticMatches, 29 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4281 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1715, Invalid=9627, Unknown=0, NotChecked=0, Total=11342 [2022-10-16 10:58:31,573 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 413 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:58:31,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 400 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 10:58:31,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-10-16 10:58:31,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 567. [2022-10-16 10:58:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 560 states have (on average 1.1857142857142857) internal successors, (664), 566 states have internal predecessors, (664), 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 10:58:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 664 transitions. [2022-10-16 10:58:31,634 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 664 transitions. Word has length 87 [2022-10-16 10:58:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:58:31,635 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 664 transitions. [2022-10-16 10:58:31,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.9038461538461537) internal successors, (151), 52 states have internal predecessors, (151), 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 10:58:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 664 transitions. [2022-10-16 10:58:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-10-16 10:58:31,636 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:58:31,636 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:58:31,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-10-16 10:58:31,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-10-16 10:58:31,850 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:58:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:58:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1339241884, now seen corresponding path program 14 times [2022-10-16 10:58:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:58:31,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303272795] [2022-10-16 10:58:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:58:31,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:58:31,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:58:31,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320228970] [2022-10-16 10:58:31,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:58:31,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:58:31,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:58:31,881 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:58:31,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-10-16 10:58:32,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:58:32,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:58:32,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 10:58:32,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:58:32,040 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 10 treesize of output 8 [2022-10-16 10:58:32,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:58:32,410 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:58:32,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:58:32,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:58:32,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:58:32,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:58:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:58:32,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:58:32,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 6)) is different from false [2022-10-16 10:58:32,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) is different from false [2022-10-16 10:58:33,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:58:33,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) is different from false [2022-10-16 10:58:33,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) is different from false [2022-10-16 10:58:33,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)) is different from false [2022-10-16 10:58:33,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:58:33,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_378|)) (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-10-16 10:58:33,158 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-10-16 10:58:35,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 5 |c_ULTIMATE.start_main_#t~mem9#1|)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 6) (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:58:35,327 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:58:35,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:58:35,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:58:35,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:58:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 45 trivial. 75 not checked. [2022-10-16 10:58:35,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:58:35,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303272795] [2022-10-16 10:58:35,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:58:35,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320228970] [2022-10-16 10:58:35,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320228970] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:58:35,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:58:35,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 40 [2022-10-16 10:58:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576692467] [2022-10-16 10:58:35,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:58:35,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:58:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:58:35,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:58:35,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=778, Unknown=10, NotChecked=650, Total=1560 [2022-10-16 10:58:35,480 INFO L87 Difference]: Start difference. First operand 567 states and 664 transitions. Second operand has 40 states, 40 states have (on average 2.775) internal successors, (111), 40 states have internal predecessors, (111), 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 10:58:36,567 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 6 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= 3 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:58:38,572 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 3 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_378|)) (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 6 (select .cse0 .cse1)))) is different from false [2022-10-16 10:58:39,487 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 6 (select .cse0 .cse1)) (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse2 (+ 5 |c_ULTIMATE.start_main_#t~mem9#1|)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6) (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:58:40,259 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 6 (select .cse0 .cse1)) (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6)) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-10-16 10:58:42,264 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_378|)) (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 6 (select .cse0 .cse1)) (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 6)))) is different from false [2022-10-16 10:58:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:58:43,125 INFO L93 Difference]: Finished difference Result 684 states and 800 transitions. [2022-10-16 10:58:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-16 10:58:43,126 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 40 states have internal predecessors, (111), 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 88 [2022-10-16 10:58:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:58:43,128 INFO L225 Difference]: With dead ends: 684 [2022-10-16 10:58:43,128 INFO L226 Difference]: Without dead ends: 651 [2022-10-16 10:58:43,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 136 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=203, Invalid=1402, Unknown=15, NotChecked=1350, Total=2970 [2022-10-16 10:58:43,130 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 100 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1014 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:58:43,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 594 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 987 Invalid, 0 Unknown, 1014 Unchecked, 0.6s Time] [2022-10-16 10:58:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-10-16 10:58:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 622. [2022-10-16 10:58:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 615 states have (on average 1.175609756097561) internal successors, (723), 621 states have internal predecessors, (723), 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 10:58:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 723 transitions. [2022-10-16 10:58:43,204 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 723 transitions. Word has length 88 [2022-10-16 10:58:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:58:43,205 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 723 transitions. [2022-10-16 10:58:43,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 40 states have internal predecessors, (111), 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 10:58:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 723 transitions. [2022-10-16 10:58:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-16 10:58:43,206 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:58:43,206 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:58:43,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-10-16 10:58:43,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-10-16 10:58:43,422 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:58:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:58:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2096094215, now seen corresponding path program 14 times [2022-10-16 10:58:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:58:43,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026658918] [2022-10-16 10:58:43,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:58:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:58:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:58:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:58:45,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:58:45,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026658918] [2022-10-16 10:58:45,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026658918] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:58:45,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131448408] [2022-10-16 10:58:45,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:58:45,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:58:45,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:58:45,919 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:58:45,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-10-16 10:58:46,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:58:46,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:58:46,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 83 conjunts are in the unsatisfiable core [2022-10-16 10:58:46,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:58:46,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:58:46,262 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:58:46,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:58:46,356 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:58:46,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:58:46,513 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:58:46,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:58:46,671 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:58:46,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:58:46,831 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:58:46,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:58:47,000 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:58:47,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:58:47,170 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:58:47,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:58:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:58:47,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:58:47,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 14 [2022-10-16 10:58:47,644 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 20 treesize of output 16 [2022-10-16 10:58:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:58:47,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131448408] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:58:47,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:58:47,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 50 [2022-10-16 10:58:47,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130660606] [2022-10-16 10:58:47,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:58:47,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-10-16 10:58:47,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:58:47,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-10-16 10:58:47,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2310, Unknown=0, NotChecked=0, Total=2450 [2022-10-16 10:58:47,759 INFO L87 Difference]: Start difference. First operand 622 states and 723 transitions. Second operand has 50 states, 50 states have (on average 2.92) internal successors, (146), 50 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:58:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:58:50,882 INFO L93 Difference]: Finished difference Result 836 states and 1001 transitions. [2022-10-16 10:58:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-16 10:58:50,883 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.92) internal successors, (146), 50 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-10-16 10:58:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:58:50,885 INFO L225 Difference]: With dead ends: 836 [2022-10-16 10:58:50,885 INFO L226 Difference]: Without dead ends: 663 [2022-10-16 10:58:50,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=272, Invalid=4840, Unknown=0, NotChecked=0, Total=5112 [2022-10-16 10:58:50,887 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 162 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 3638 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 3687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:58:50,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1327 Invalid, 3687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3638 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-10-16 10:58:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-10-16 10:58:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 636. [2022-10-16 10:58:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 629 states have (on average 1.1748807631160572) internal successors, (739), 635 states have internal predecessors, (739), 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 10:58:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 739 transitions. [2022-10-16 10:58:50,971 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 739 transitions. Word has length 91 [2022-10-16 10:58:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:58:50,971 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 739 transitions. [2022-10-16 10:58:50,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.92) internal successors, (146), 50 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:58:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 739 transitions. [2022-10-16 10:58:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 10:58:50,973 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:58:50,973 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]