/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/indp3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:21:10,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:21:10,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:21:10,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:21:10,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:21:10,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:21:10,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:21:10,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:21:10,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:21:10,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:21:10,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:21:10,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:21:10,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:21:10,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:21:10,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:21:10,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:21:10,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:21:10,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:21:10,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:21:10,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:21:10,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:21:10,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:21:10,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:21:10,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:21:10,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:21:10,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:21:10,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:21:10,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:21:10,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:21:10,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:21:10,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:21:10,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:21:10,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:21:10,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:21:10,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:21:10,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:21:10,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:21:10,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:21:10,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:21:10,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:21:10,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:21:10,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 23:21:10,382 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:21:10,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:21:10,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:21:10,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:21:10,383 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:21:10,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:21:10,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:21:10,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:21:10,384 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:21:10,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:21:10,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:21:10,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:21:10,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:21:10,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:21:10,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:21:10,385 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:21:10,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:21:10,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:21:10,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:21:10,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:21:10,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:21:10,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:21:10,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:21:10,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:21:10,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:21:10,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:21:10,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:21:10,387 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:21:10,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:21:10,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:21:10,387 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-09 23:21:10,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:21:10,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:21:10,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:21:10,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:21:10,564 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:21:10,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/indp3.c [2022-01-09 23:21:10,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448eb1509/b7266d5932824deb8f5b8512be0ea7f9/FLAGfd3a251ee [2022-01-09 23:21:10,952 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:21:10,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp3.c [2022-01-09 23:21:10,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448eb1509/b7266d5932824deb8f5b8512be0ea7f9/FLAGfd3a251ee [2022-01-09 23:21:10,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448eb1509/b7266d5932824deb8f5b8512be0ea7f9 [2022-01-09 23:21:10,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:21:10,972 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:21:10,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:21:10,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:21:10,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:21:10,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:21:10" (1/1) ... [2022-01-09 23:21:10,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae3b0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:10, skipping insertion in model container [2022-01-09 23:21:10,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:21:10" (1/1) ... [2022-01-09 23:21:10,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:21:10,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:21:11,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp3.c[588,601] [2022-01-09 23:21:11,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:21:11,137 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:21:11,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp3.c[588,601] [2022-01-09 23:21:11,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:21:11,162 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:21:11,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11 WrapperNode [2022-01-09 23:21:11,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:21:11,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:21:11,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:21:11,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:21:11,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (1/1) ... [2022-01-09 23:21:11,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (1/1) ... [2022-01-09 23:21:11,186 INFO L137 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2022-01-09 23:21:11,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:21:11,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:21:11,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:21:11,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:21:11,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (1/1) ... [2022-01-09 23:21:11,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (1/1) ... [2022-01-09 23:21:11,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (1/1) ... [2022-01-09 23:21:11,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (1/1) ... [2022-01-09 23:21:11,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (1/1) ... [2022-01-09 23:21:11,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (1/1) ... [2022-01-09 23:21:11,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (1/1) ... [2022-01-09 23:21:11,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:21:11,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:21:11,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:21:11,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:21:11,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (1/1) ... [2022-01-09 23:21:11,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:21:11,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:11,229 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-01-09 23:21:11,231 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-01-09 23:21:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:21:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:21:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-09 23:21:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-09 23:21:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:21:11,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:21:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-09 23:21:11,294 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:21:11,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:21:11,396 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:21:11,401 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:21:11,401 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-09 23:21:11,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:21:11 BoogieIcfgContainer [2022-01-09 23:21:11,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:21:11,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:21:11,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:21:11,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:21:11,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:21:10" (1/3) ... [2022-01-09 23:21:11,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100d28a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:21:11, skipping insertion in model container [2022-01-09 23:21:11,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:11" (2/3) ... [2022-01-09 23:21:11,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100d28a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:21:11, skipping insertion in model container [2022-01-09 23:21:11,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:21:11" (3/3) ... [2022-01-09 23:21:11,419 INFO L111 eAbstractionObserver]: Analyzing ICFG indp3.c [2022-01-09 23:21:11,424 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:21:11,424 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:21:11,486 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:21:11,491 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-09 23:21:11,491 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:21:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 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-01-09 23:21:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-09 23:21:11,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:11,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:11,510 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:11,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-01-09 23:21:11,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:11,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294627895] [2022-01-09 23:21:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:11,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:21:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:11,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:11,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294627895] [2022-01-09 23:21:11,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294627895] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:21:11,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:21:11,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-09 23:21:11,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606971770] [2022-01-09 23:21:11,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:21:11,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-09 23:21:11,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:11,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-09 23:21:11,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:21:11,708 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 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) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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-01-09 23:21:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:11,724 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-01-09 23:21:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-09 23:21:11,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-01-09 23:21:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:11,731 INFO L225 Difference]: With dead ends: 50 [2022-01-09 23:21:11,732 INFO L226 Difference]: Without dead ends: 23 [2022-01-09 23:21:11,735 INFO L932 BasicCegarLoop]: 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-01-09 23:21:11,738 INFO L933 BasicCegarLoop]: 32 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, 32 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-01-09 23:21:11,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:21:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-09 23:21:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-09 23:21:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-01-09 23:21:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-09 23:21:11,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-01-09 23:21:11,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:11,771 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-09 23:21:11,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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-01-09 23:21:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-09 23:21:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-09 23:21:11,773 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:11,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:11,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:21:11,774 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-01-09 23:21:11,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:11,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230125648] [2022-01-09 23:21:11,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:11,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:21:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:11,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:11,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230125648] [2022-01-09 23:21:11,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230125648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:21:11,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:21:11,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:21:11,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120816329] [2022-01-09 23:21:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:21:11,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:21:11,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:11,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:21:11,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:21:11,874 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-01-09 23:21:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:11,947 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-01-09 23:21:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:21:11,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-01-09 23:21:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:11,948 INFO L225 Difference]: With dead ends: 53 [2022-01-09 23:21:11,948 INFO L226 Difference]: Without dead ends: 37 [2022-01-09 23:21:11,951 INFO L932 BasicCegarLoop]: 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-01-09 23:21:11,952 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:21:11,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:21:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-09 23:21:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-01-09 23:21:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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-01-09 23:21:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-09 23:21:11,960 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-01-09 23:21:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:11,961 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-09 23:21:11,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-01-09 23:21:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-09 23:21:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-09 23:21:11,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:11,962 INFO L514 BasicCegarLoop]: 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] [2022-01-09 23:21:11,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:21:11,962 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:11,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-01-09 23:21:11,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:11,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034300385] [2022-01-09 23:21:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:11,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:11,999 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:21:12,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753932176] [2022-01-09 23:21:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:12,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:12,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:12,003 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-01-09 23:21:12,005 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-01-09 23:21:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:21:12,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-09 23:21:12,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:21:12,138 INFO L387 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-01-09 23:21:12,206 INFO L387 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 23 treesize of output 11 [2022-01-09 23:21:12,251 INFO L387 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 23 treesize of output 11 [2022-01-09 23:21:12,293 INFO L387 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-01-09 23:21:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:12,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:21:12,523 INFO L387 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 22 treesize of output 20 [2022-01-09 23:21:12,527 INFO L387 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 36 treesize of output 34 [2022-01-09 23:21:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:21:12,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:12,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034300385] [2022-01-09 23:21:12,551 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:21:12,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753932176] [2022-01-09 23:21:12,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753932176] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:21:12,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:21:12,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-01-09 23:21:12,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023798976] [2022-01-09 23:21:12,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:21:12,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-09 23:21:12,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-09 23:21:12,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-01-09 23:21:12,556 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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-01-09 23:21:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:12,718 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-01-09 23:21:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-09 23:21:12,718 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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 24 [2022-01-09 23:21:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:12,719 INFO L225 Difference]: With dead ends: 60 [2022-01-09 23:21:12,719 INFO L226 Difference]: Without dead ends: 58 [2022-01-09 23:21:12,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:21:12,720 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:21:12,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 111 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:21:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-09 23:21:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2022-01-09 23:21:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 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-01-09 23:21:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-01-09 23:21:12,750 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 24 [2022-01-09 23:21:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:12,751 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-01-09 23:21:12,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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-01-09 23:21:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-01-09 23:21:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-09 23:21:12,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:12,752 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:12,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-09 23:21:12,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:12,968 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:12,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1411307230, now seen corresponding path program 2 times [2022-01-09 23:21:12,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:12,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686571186] [2022-01-09 23:21:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:12,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:12,982 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:21:12,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067422647] [2022-01-09 23:21:12,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:21:12,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:12,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:12,983 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-01-09 23:21:12,984 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-01-09 23:21:13,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:21:13,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:21:13,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 23:21:13,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:21:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-09 23:21:13,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:21:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-09 23:21:13,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:13,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686571186] [2022-01-09 23:21:13,189 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:21:13,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067422647] [2022-01-09 23:21:13,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067422647] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:21:13,189 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:21:13,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-09 23:21:13,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509023287] [2022-01-09 23:21:13,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:21:13,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-09 23:21:13,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-09 23:21:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:21:13,190 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 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-01-09 23:21:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:13,300 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-01-09 23:21:13,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:21:13,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 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 28 [2022-01-09 23:21:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:13,301 INFO L225 Difference]: With dead ends: 100 [2022-01-09 23:21:13,302 INFO L226 Difference]: Without dead ends: 55 [2022-01-09 23:21:13,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:21:13,302 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 52 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:21:13,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 48 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:21:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-09 23:21:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-01-09 23:21:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:21:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-01-09 23:21:13,307 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 28 [2022-01-09 23:21:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:13,307 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-01-09 23:21:13,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 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-01-09 23:21:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-01-09 23:21:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:21:13,308 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:13,308 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:13,327 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-01-09 23:21:13,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-09 23:21:13,524 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2147373800, now seen corresponding path program 3 times [2022-01-09 23:21:13,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:13,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9001787] [2022-01-09 23:21:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:13,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:13,536 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:21:13,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189636228] [2022-01-09 23:21:13,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-09 23:21:13,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:13,537 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-01-09 23:21:13,538 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-01-09 23:21:13,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-09 23:21:13,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:21:13,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-09 23:21:13,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:21:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-09 23:21:13,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:21:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-09 23:21:13,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:13,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9001787] [2022-01-09 23:21:13,760 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:21:13,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189636228] [2022-01-09 23:21:13,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189636228] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:21:13,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:21:13,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-09 23:21:13,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890019056] [2022-01-09 23:21:13,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:21:13,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-09 23:21:13,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-09 23:21:13,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:21:13,762 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:21:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:13,923 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2022-01-09 23:21:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-09 23:21:13,924 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-09 23:21:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:13,927 INFO L225 Difference]: With dead ends: 124 [2022-01-09 23:21:13,927 INFO L226 Difference]: Without dead ends: 95 [2022-01-09 23:21:13,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:21:13,928 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 123 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:21:13,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 55 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:21:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-09 23:21:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2022-01-09 23:21:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 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-01-09 23:21:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-01-09 23:21:13,942 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 34 [2022-01-09 23:21:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:13,942 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-01-09 23:21:13,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:21:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-01-09 23:21:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-09 23:21:13,943 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:13,943 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2022-01-09 23:21:13,965 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-01-09 23:21:14,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:14,152 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:14,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-01-09 23:21:14,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:14,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317318533] [2022-01-09 23:21:14,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:14,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:14,164 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:21:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628019893] [2022-01-09 23:21:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:14,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:14,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:14,178 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-01-09 23:21:14,179 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-01-09 23:21:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:21:14,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-09 23:21:14,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:21:14,250 INFO L387 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-01-09 23:21:14,280 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-09 23:21:14,280 INFO L387 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-01-09 23:21:14,299 INFO L387 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-01-09 23:21:14,331 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-09 23:21:14,331 INFO L387 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 27 treesize of output 26 [2022-01-09 23:21:14,355 INFO L387 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 33 treesize of output 17 [2022-01-09 23:21:14,408 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-09 23:21:14,408 INFO L387 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-01-09 23:21:14,431 INFO L387 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-01-09 23:21:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:14,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:21:14,803 INFO L387 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 22 treesize of output 20 [2022-01-09 23:21:14,806 INFO L387 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 38 treesize of output 34 [2022-01-09 23:21:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:14,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:14,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317318533] [2022-01-09 23:21:14,823 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:21:14,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628019893] [2022-01-09 23:21:14,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628019893] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:21:14,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:21:14,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 25 [2022-01-09 23:21:14,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902018653] [2022-01-09 23:21:14,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:21:14,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-09 23:21:14,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:14,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-09 23:21:14,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-01-09 23:21:14,824 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-09 23:21:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:15,333 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2022-01-09 23:21:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-09 23:21:15,333 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-09 23:21:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:15,334 INFO L225 Difference]: With dead ends: 152 [2022-01-09 23:21:15,334 INFO L226 Difference]: Without dead ends: 125 [2022-01-09 23:21:15,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 12 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2022-01-09 23:21:15,335 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 117 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:21:15,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 257 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 561 Invalid, 0 Unknown, 119 Unchecked, 0.3s Time] [2022-01-09 23:21:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-01-09 23:21:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 87. [2022-01-09 23:21:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 0 states have call successors, (0), 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-01-09 23:21:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2022-01-09 23:21:15,343 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 36 [2022-01-09 23:21:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:15,343 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2022-01-09 23:21:15,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-09 23:21:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2022-01-09 23:21:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-09 23:21:15,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:15,344 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:15,364 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-01-09 23:21:15,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:15,559 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 4 times [2022-01-09 23:21:15,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:15,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350070059] [2022-01-09 23:21:15,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:15,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:15,569 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:21:15,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [913654307] [2022-01-09 23:21:15,569 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-09 23:21:15,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:15,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:15,570 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-01-09 23:21:15,576 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-01-09 23:21:15,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-09 23:21:15,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:21:15,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-09 23:21:15,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:21:15,647 INFO L387 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 21 treesize of output 17 [2022-01-09 23:21:15,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:15,678 INFO L387 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 23 treesize of output 22 [2022-01-09 23:21:15,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:15,703 INFO L387 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 23 treesize of output 22 [2022-01-09 23:21:15,737 INFO L387 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 43 treesize of output 23 [2022-01-09 23:21:15,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:15,758 INFO L387 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 23 treesize of output 22 [2022-01-09 23:21:15,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:15,774 INFO L387 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 23 treesize of output 22 [2022-01-09 23:21:15,806 INFO L387 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 43 treesize of output 23 [2022-01-09 23:21:15,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:15,826 INFO L387 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 23 treesize of output 22 [2022-01-09 23:21:15,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:15,845 INFO L387 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 23 treesize of output 22 [2022-01-09 23:21:15,888 INFO L387 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 43 treesize of output 23 [2022-01-09 23:21:15,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:15,926 INFO L387 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 23 treesize of output 22 [2022-01-09 23:21:15,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:15,952 INFO L387 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 23 treesize of output 22 [2022-01-09 23:21:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:16,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:21:18,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (forall ((v_ArrVal_225 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:18,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:20,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_225 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (= (select (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_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))))) is different from false [2022-01-09 23:21:22,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:24,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_101| Int)) (or (forall ((v_ArrVal_225 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int)) (or (= (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_101|)))) is different from false [2022-01-09 23:21:26,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (= (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:28,953 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_102| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_102|)) (forall ((v_ArrVal_225 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (= (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))))) is different from false [2022-01-09 23:21:31,050 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) |c_ULTIMATE.start_main_~i~0#1|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:31,654 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (= 0 (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:32,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:34,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_105| Int)) (or (forall ((v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_105|)))) is different from false [2022-01-09 23:21:36,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:38,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_106|)) (forall ((v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))))) is different from false [2022-01-09 23:21:39,956 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_106|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) |c_ULTIMATE.start_main_~i~0#1|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:40,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_106|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:41,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_208 Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_106|)) (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:44,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_208 Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_106|)) (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_109|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))) is different from false [2022-01-09 23:21:46,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_208 Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_206 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_106|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_109|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (= 0 (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_206) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_109|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-01-09 23:21:48,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_110|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_208 Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_206 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_106|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_110|)) v_ArrVal_206) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_109|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))))) is different from false [2022-01-09 23:21:48,676 INFO L387 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 372 treesize of output 356 [2022-01-09 23:21:48,682 INFO L387 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 1995 treesize of output 1979 [2022-01-09 23:21:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 34 not checked. [2022-01-09 23:21:49,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:49,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350070059] [2022-01-09 23:21:49,083 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:21:49,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913654307] [2022-01-09 23:21:49,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913654307] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:21:49,083 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:21:49,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 28] total 37 [2022-01-09 23:21:49,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858407606] [2022-01-09 23:21:49,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:21:49,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-09 23:21:49,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:49,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-09 23:21:49,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=264, Unknown=19, NotChecked=950, Total=1332 [2022-01-09 23:21:49,085 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 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-01-09 23:21:51,100 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_110|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_208 Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_206 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_106|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_110|)) v_ArrVal_206) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_109|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse3 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|))) (* .cse3 .cse3))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:21:53,115 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_208 Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_106|)) (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_109|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:21:53,768 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_106|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:21:54,368 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_106|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:21:54,971 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_106|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:21:55,602 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse0 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|))) (* .cse0 .cse0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_106|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (= (select (store (store (let ((.cse1 (store (store (let ((.cse2 (store (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) |c_ULTIMATE.start_main_~i~0#1|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|))))) is different from false [2022-01-09 23:21:57,609 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse0 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|))) (* .cse0 .cse0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_106| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_106|)) (forall ((v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (= (select (store (store (let ((.cse1 (store (store (let ((.cse2 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_106|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_211) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_106| 1) |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:21:59,637 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_105| Int)) (or (forall ((v_ArrVal_225 Int) (v_ArrVal_213 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_105|)))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:22:00,209 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (= 0 (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:22:00,695 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (= 0 (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:22:01,193 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (= 0 (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:22:01,707 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse0 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|))) (* .cse0 .cse0))) (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_102| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (= (select (store (store (let ((.cse1 (store (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) |c_ULTIMATE.start_main_~i~0#1|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_102|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:22:03,711 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse0 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|))) (* .cse0 .cse0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_102| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_102|)) (forall ((v_ArrVal_225 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_101| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_102| 1) |v_ULTIMATE.start_main_~i~0#1_101|)) (= (select (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_102|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:22:05,731 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_101| Int)) (or (forall ((v_ArrVal_225 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_219 Int)) (or (= (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_101|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_101|)))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:22:07,766 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_225 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (= (select (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_98| 8)) v_ArrVal_223) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_98| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ (- 1) (let ((.cse0 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|))) (* .cse0 .cse0))))) is different from false [2022-01-09 23:22:09,777 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (forall ((v_ArrVal_225 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_97|)))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:22:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:22:09,844 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2022-01-09 23:22:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-09 23:22:09,845 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 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 40 [2022-01-09 23:22:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:22:09,845 INFO L225 Difference]: With dead ends: 107 [2022-01-09 23:22:09,845 INFO L226 Difference]: Without dead ends: 105 [2022-01-09 23:22:09,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 36 SyntacticMatches, 14 SemanticMatches, 53 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 50.3s TimeCoverageRelationStatistics Valid=147, Invalid=338, Unknown=35, NotChecked=2450, Total=2970 [2022-01-09 23:22:09,847 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 834 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:22:09,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 165 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 202 Invalid, 0 Unknown, 834 Unchecked, 0.1s Time] [2022-01-09 23:22:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-09 23:22:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-01-09 23:22:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 86 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-01-09 23:22:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2022-01-09 23:22:09,853 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 40 [2022-01-09 23:22:09,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:22:09,853 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2022-01-09 23:22:09,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 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-01-09 23:22:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2022-01-09 23:22:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-09 23:22:09,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:22:09,854 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:22:09,876 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-01-09 23:22:10,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:22:10,066 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:22:10,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:22:10,066 INFO L85 PathProgramCache]: Analyzing trace with hash 17797256, now seen corresponding path program 2 times [2022-01-09 23:22:10,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:22:10,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979747400] [2022-01-09 23:22:10,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:22:10,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:22:10,075 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:22:10,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496656222] [2022-01-09 23:22:10,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:22:10,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:22:10,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:22:10,077 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-01-09 23:22:10,077 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-01-09 23:22:10,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:22:10,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:22:10,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-09 23:22:10,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:22:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-09 23:22:10,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:22:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-09 23:22:10,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:22:10,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979747400] [2022-01-09 23:22:10,353 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:22:10,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496656222] [2022-01-09 23:22:10,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496656222] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:22:10,353 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:22:10,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-09 23:22:10,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054004533] [2022-01-09 23:22:10,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:22:10,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-09 23:22:10,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:22:10,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-09 23:22:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-09 23:22:10,354 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 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-01-09 23:22:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:22:10,619 INFO L93 Difference]: Finished difference Result 249 states and 278 transitions. [2022-01-09 23:22:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-09 23:22:10,619 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 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 44 [2022-01-09 23:22:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:22:10,620 INFO L225 Difference]: With dead ends: 249 [2022-01-09 23:22:10,620 INFO L226 Difference]: Without dead ends: 179 [2022-01-09 23:22:10,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2022-01-09 23:22:10,621 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 173 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:22:10,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 98 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:22:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-01-09 23:22:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 137. [2022-01-09 23:22:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 136 states have internal predecessors, (154), 0 states have call successors, (0), 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-01-09 23:22:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2022-01-09 23:22:10,656 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 44 [2022-01-09 23:22:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:22:10,656 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2022-01-09 23:22:10,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 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-01-09 23:22:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2022-01-09 23:22:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-09 23:22:10,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:22:10,657 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:22:10,674 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-01-09 23:22:10,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:22:10,868 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:22:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:22:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1935751430, now seen corresponding path program 3 times [2022-01-09 23:22:10,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:22:10,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303792437] [2022-01-09 23:22:10,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:22:10,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:22:10,875 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:22:10,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698023027] [2022-01-09 23:22:10,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-09 23:22:10,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:22:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:22:10,876 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-01-09 23:22:10,877 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-01-09 23:22:10,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-09 23:22:10,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:22:10,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-09 23:22:10,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:22:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-09 23:22:11,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:22:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-09 23:22:11,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:22:11,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303792437] [2022-01-09 23:22:11,140 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:22:11,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698023027] [2022-01-09 23:22:11,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698023027] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:22:11,140 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:22:11,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-01-09 23:22:11,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718497821] [2022-01-09 23:22:11,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:22:11,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-09 23:22:11,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:22:11,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-09 23:22:11,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-01-09 23:22:11,141 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 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-01-09 23:22:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:22:11,434 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2022-01-09 23:22:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-09 23:22:11,435 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 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 46 [2022-01-09 23:22:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:22:11,435 INFO L225 Difference]: With dead ends: 185 [2022-01-09 23:22:11,435 INFO L226 Difference]: Without dead ends: 134 [2022-01-09 23:22:11,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-01-09 23:22:11,436 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 128 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:22:11,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 127 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:22:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-01-09 23:22:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2022-01-09 23:22:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.0789473684210527) internal successors, (123), 114 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:22:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2022-01-09 23:22:11,444 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 46 [2022-01-09 23:22:11,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:22:11,444 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2022-01-09 23:22:11,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 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-01-09 23:22:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-01-09 23:22:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-09 23:22:11,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:22:11,445 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:22:11,471 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-01-09 23:22:11,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:22:11,664 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:22:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:22:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1258986306, now seen corresponding path program 4 times [2022-01-09 23:22:11,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:22:11,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002879937] [2022-01-09 23:22:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:22:11,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:22:11,672 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:22:11,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304112510] [2022-01-09 23:22:11,672 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-09 23:22:11,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:22:11,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:22:11,673 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-01-09 23:22:11,674 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-01-09 23:22:11,733 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-09 23:22:11,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:22:11,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 65 conjunts are in the unsatisfiable core [2022-01-09 23:22:11,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:22:11,777 INFO L387 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-01-09 23:22:11,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:11,808 INFO L387 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 25 treesize of output 24 [2022-01-09 23:22:11,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:11,827 INFO L387 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 25 treesize of output 24 [2022-01-09 23:22:11,844 INFO L387 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-01-09 23:22:11,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:11,878 INFO L387 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 27 treesize of output 26 [2022-01-09 23:22:11,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:11,904 INFO L387 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 27 treesize of output 26 [2022-01-09 23:22:11,937 INFO L387 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 33 treesize of output 17 [2022-01-09 23:22:11,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:11,976 INFO L387 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 25 treesize of output 24 [2022-01-09 23:22:12,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:12,004 INFO L387 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 25 treesize of output 24 [2022-01-09 23:22:12,032 INFO L387 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-01-09 23:22:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:22:12,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:22:12,913 INFO L387 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 158 treesize of output 150 [2022-01-09 23:22:12,915 INFO L387 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 1690 treesize of output 1658 [2022-01-09 23:22:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:22:13,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:22:13,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002879937] [2022-01-09 23:22:13,050 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:22:13,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304112510] [2022-01-09 23:22:13,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304112510] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:22:13,051 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:22:13,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 47 [2022-01-09 23:22:13,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064664247] [2022-01-09 23:22:13,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:22:13,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-09 23:22:13,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:22:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-09 23:22:13,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1974, Unknown=0, NotChecked=0, Total=2162 [2022-01-09 23:22:13,052 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 47 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 47 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-01-09 23:22:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:22:13,580 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-01-09 23:22:13,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-09 23:22:13,581 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 47 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 48 [2022-01-09 23:22:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:22:13,582 INFO L225 Difference]: With dead ends: 143 [2022-01-09 23:22:13,582 INFO L226 Difference]: Without dead ends: 106 [2022-01-09 23:22:13,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=249, Invalid=2613, Unknown=0, NotChecked=0, Total=2862 [2022-01-09 23:22:13,586 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 55 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 463 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:22:13,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 381 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 520 Invalid, 0 Unknown, 463 Unchecked, 0.2s Time] [2022-01-09 23:22:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-09 23:22:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2022-01-09 23:22:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 79 states have internal predecessors, (87), 0 states have call successors, (0), 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-01-09 23:22:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-01-09 23:22:13,603 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 48 [2022-01-09 23:22:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:22:13,603 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-01-09 23:22:13,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 47 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-01-09 23:22:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-01-09 23:22:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-09 23:22:13,604 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:22:13,604 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:22:13,623 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-01-09 23:22:13,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-09 23:22:13,805 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:22:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:22:13,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1459720962, now seen corresponding path program 5 times [2022-01-09 23:22:13,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:22:13,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956014212] [2022-01-09 23:22:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:22:13,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:22:13,815 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:22:13,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733444895] [2022-01-09 23:22:13,815 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-09 23:22:13,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:22:13,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:22:13,818 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-01-09 23:22:13,819 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-01-09 23:22:14,290 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-09 23:22:14,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:22:14,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-09 23:22:14,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:22:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-01-09 23:22:14,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:22:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-01-09 23:22:14,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:22:14,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956014212] [2022-01-09 23:22:14,526 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:22:14,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733444895] [2022-01-09 23:22:14,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733444895] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:22:14,526 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:22:14,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-01-09 23:22:14,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144552291] [2022-01-09 23:22:14,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:22:14,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-09 23:22:14,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:22:14,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-09 23:22:14,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-01-09 23:22:14,528 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 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-01-09 23:22:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:22:14,737 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2022-01-09 23:22:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-09 23:22:14,737 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 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-01-09 23:22:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:22:14,738 INFO L225 Difference]: With dead ends: 195 [2022-01-09 23:22:14,738 INFO L226 Difference]: Without dead ends: 161 [2022-01-09 23:22:14,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2022-01-09 23:22:14,738 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 202 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:22:14,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 108 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:22:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-01-09 23:22:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 123. [2022-01-09 23:22:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.0901639344262295) internal successors, (133), 122 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-01-09 23:22:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-01-09 23:22:14,747 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 54 [2022-01-09 23:22:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:22:14,747 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-01-09 23:22:14,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 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-01-09 23:22:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-01-09 23:22:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-09 23:22:14,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:22:14,748 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:22:14,767 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-01-09 23:22:14,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:22:14,963 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:22:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:22:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1968554954, now seen corresponding path program 6 times [2022-01-09 23:22:14,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:22:14,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768075204] [2022-01-09 23:22:14,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:22:14,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:22:14,972 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:22:14,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332524937] [2022-01-09 23:22:14,972 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-09 23:22:14,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:22:14,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:22:14,973 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-01-09 23:22:14,977 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-01-09 23:22:15,200 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-09 23:22:15,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:22:15,203 WARN L261 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 113 conjunts are in the unsatisfiable core [2022-01-09 23:22:15,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:22:15,232 INFO L387 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 21 treesize of output 17 [2022-01-09 23:22:15,282 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-09 23:22:15,284 INFO L387 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 23 treesize of output 28 [2022-01-09 23:22:15,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:15,341 INFO L353 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2022-01-09 23:22:15,342 INFO L387 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 2 case distinctions, treesize of input 57 treesize of output 59 [2022-01-09 23:22:15,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:15,499 INFO L353 Elim1Store]: treesize reduction 90, result has 41.9 percent of original size [2022-01-09 23:22:15,499 INFO L387 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 6 case distinctions, treesize of input 68 treesize of output 107 [2022-01-09 23:22:17,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:22:17,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:17,395 INFO L353 Elim1Store]: treesize reduction 137, result has 16.5 percent of original size [2022-01-09 23:22:17,395 INFO L387 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 8 case distinctions, treesize of input 245 treesize of output 208 [2022-01-09 23:22:17,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:17,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:18,045 INFO L353 Elim1Store]: treesize reduction 93, result has 42.2 percent of original size [2022-01-09 23:22:18,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 245 treesize of output 247 [2022-01-09 23:22:20,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:20,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:20,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:20,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:20,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:20,053 INFO L353 Elim1Store]: treesize reduction 88, result has 26.7 percent of original size [2022-01-09 23:22:20,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 411 treesize of output 358 [2022-01-09 23:22:21,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,722 INFO L353 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2022-01-09 23:22:21,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 410 treesize of output 348 [2022-01-09 23:22:21,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:22:21,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:21,990 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:22:21,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 55 [2022-01-09 23:22:22,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,155 INFO L353 Elim1Store]: treesize reduction 68, result has 32.7 percent of original size [2022-01-09 23:22:22,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 66 [2022-01-09 23:22:22,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,439 INFO L353 Elim1Store]: treesize reduction 126, result has 31.5 percent of original size [2022-01-09 23:22:22,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 81 treesize of output 113 [2022-01-09 23:22:22,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:22,717 INFO L353 Elim1Store]: treesize reduction 66, result has 40.0 percent of original size [2022-01-09 23:22:22,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 88 [2022-01-09 23:22:23,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:22:23,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:23,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:23,217 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:22:23,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-01-09 23:22:23,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:23,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:22:23,320 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:22:23,321 INFO L387 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 3 case distinctions, treesize of input 47 treesize of output 44 [2022-01-09 23:22:23,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:22:23,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:23,428 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:22:23,428 INFO L387 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 3 case distinctions, treesize of input 44 treesize of output 43 [2022-01-09 23:22:23,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:23,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:23,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:22:23,539 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:22:23,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-01-09 23:22:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:22:24,111 INFO L328 TraceCheckSpWp]: Computing backward predicates...