/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/eqn3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 00:56:16,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 00:56:16,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 00:56:16,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 00:56:16,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 00:56:16,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 00:56:16,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 00:56:16,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 00:56:16,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 00:56:16,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 00:56:16,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 00:56:16,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 00:56:16,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 00:56:16,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 00:56:16,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 00:56:16,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 00:56:16,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 00:56:16,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 00:56:16,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 00:56:16,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 00:56:16,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 00:56:16,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 00:56:16,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 00:56:16,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 00:56:16,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 00:56:16,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 00:56:16,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 00:56:16,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 00:56:16,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 00:56:16,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 00:56:16,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 00:56:16,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 00:56:16,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 00:56:16,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 00:56:16,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 00:56:16,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 00:56:16,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 00:56:16,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 00:56:16,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 00:56:16,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 00:56:16,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 00:56:16,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-31 00:56:16,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 00:56:16,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 00:56:16,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 00:56:16,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 00:56:16,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 00:56:16,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 00:56:16,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 00:56:16,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 00:56:16,550 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 00:56:16,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 00:56:16,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 00:56:16,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 00:56:16,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 00:56:16,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 00:56:16,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 00:56:16,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 00:56:16,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 00:56:16,551 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 00:56:16,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 00:56:16,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 00:56:16,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 00:56:16,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 00:56:16,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 00:56:16,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 00:56:16,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 00:56:16,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 00:56:16,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 00:56:16,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 00:56:16,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 00:56:16,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 00:56:16,553 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 00:56:16,553 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 00:56:16,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 00:56:16,553 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-31 00:56:16,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 00:56:16,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 00:56:16,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 00:56:16,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 00:56:16,794 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 00:56:16,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn3.c [2022-01-31 00:56:16,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c420b3f05/70cbb1a66bab49d0a5fab2ca36a0cb9d/FLAGc4194fc86 [2022-01-31 00:56:17,259 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 00:56:17,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn3.c [2022-01-31 00:56:17,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c420b3f05/70cbb1a66bab49d0a5fab2ca36a0cb9d/FLAGc4194fc86 [2022-01-31 00:56:17,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c420b3f05/70cbb1a66bab49d0a5fab2ca36a0cb9d [2022-01-31 00:56:17,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 00:56:17,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 00:56:17,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 00:56:17,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 00:56:17,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 00:56:17,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:56:17" (1/1) ... [2022-01-31 00:56:17,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b671e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17, skipping insertion in model container [2022-01-31 00:56:17,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:56:17" (1/1) ... [2022-01-31 00:56:17,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 00:56:17,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 00:56:17,529 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/eqn3.c[587,600] [2022-01-31 00:56:17,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 00:56:17,576 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 00:56:17,589 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/eqn3.c[587,600] [2022-01-31 00:56:17,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 00:56:17,614 INFO L208 MainTranslator]: Completed translation [2022-01-31 00:56:17,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17 WrapperNode [2022-01-31 00:56:17,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 00:56:17,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 00:56:17,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 00:56:17,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 00:56:17,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17" (1/1) ... [2022-01-31 00:56:17,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17" (1/1) ... [2022-01-31 00:56:17,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17" (1/1) ... [2022-01-31 00:56:17,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17" (1/1) ... [2022-01-31 00:56:17,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17" (1/1) ... [2022-01-31 00:56:17,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17" (1/1) ... [2022-01-31 00:56:17,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17" (1/1) ... [2022-01-31 00:56:17,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 00:56:17,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 00:56:17,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 00:56:17,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 00:56:17,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17" (1/1) ... [2022-01-31 00:56:17,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 00:56:17,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:17,728 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-31 00:56:17,730 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-31 00:56:17,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 00:56:17,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 00:56:17,777 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 00:56:17,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 00:56:17,777 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 00:56:17,778 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 00:56:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 00:56:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 00:56:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 00:56:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 00:56:17,824 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 00:56:17,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 00:56:17,932 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 00:56:17,936 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 00:56:17,936 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 00:56:17,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:56:17 BoogieIcfgContainer [2022-01-31 00:56:17,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 00:56:17,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 00:56:17,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 00:56:17,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 00:56:17,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:56:17" (1/3) ... [2022-01-31 00:56:17,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d29a49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:56:17, skipping insertion in model container [2022-01-31 00:56:17,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:56:17" (2/3) ... [2022-01-31 00:56:17,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d29a49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:56:17, skipping insertion in model container [2022-01-31 00:56:17,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:56:17" (3/3) ... [2022-01-31 00:56:17,957 INFO L111 eAbstractionObserver]: Analyzing ICFG eqn3.c [2022-01-31 00:56:17,961 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 00:56:17,961 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 00:56:17,997 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 00:56:18,012 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-31 00:56:18,013 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 00:56:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:56:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 00:56:18,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:18,034 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] [2022-01-31 00:56:18,034 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:18,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash 199879945, now seen corresponding path program 1 times [2022-01-31 00:56:18,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:18,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188707218] [2022-01-31 00:56:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:18,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:18,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:56:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:56:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:18,253 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-31 00:56:18,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:56:18,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188707218] [2022-01-31 00:56:18,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188707218] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 00:56:18,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 00:56:18,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 00:56:18,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773362560] [2022-01-31 00:56:18,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 00:56:18,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 00:56:18,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:56:18,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 00:56:18,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 00:56:18,288 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:56:18,361 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-01-31 00:56:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 00:56:18,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-01-31 00:56:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:56:18,371 INFO L225 Difference]: With dead ends: 58 [2022-01-31 00:56:18,371 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 00:56:18,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 00:56:18,380 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 00:56:18,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 00:56:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 00:56:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 00:56:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 00:56:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-01-31 00:56:18,408 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2022-01-31 00:56:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:56:18,408 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-01-31 00:56:18,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-01-31 00:56:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 00:56:18,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:18,410 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] [2022-01-31 00:56:18,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 00:56:18,411 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash -386926069, now seen corresponding path program 1 times [2022-01-31 00:56:18,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:18,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85844772] [2022-01-31 00:56:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:18,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:18,439 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:56:18,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665673913] [2022-01-31 00:56:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:18,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:18,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:18,442 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-31 00:56:18,443 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-31 00:56:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:18,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-31 00:56:18,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:56:18,584 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-31 00:56:18,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2022-01-31 00:56:18,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:56:18,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:56:18,708 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 00:56:18,714 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 7 treesize of output 3 [2022-01-31 00:56:18,778 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-01-31 00:56:18,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 27 [2022-01-31 00:56:18,808 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-31 00:56:18,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 00:56:18,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:56:18,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85844772] [2022-01-31 00:56:18,809 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:56:18,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665673913] [2022-01-31 00:56:18,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665673913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 00:56:18,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 00:56:18,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 00:56:18,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57533922] [2022-01-31 00:56:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 00:56:18,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 00:56:18,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:56:18,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 00:56:18,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 00:56:18,820 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:56:18,901 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-01-31 00:56:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 00:56:18,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-01-31 00:56:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:56:18,903 INFO L225 Difference]: With dead ends: 47 [2022-01-31 00:56:18,903 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 00:56:18,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-31 00:56:18,904 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:56:18,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 00:56:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 00:56:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-01-31 00:56:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:56:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-01-31 00:56:18,911 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2022-01-31 00:56:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:56:18,911 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-01-31 00:56:18,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-01-31 00:56:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 00:56:18,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:18,925 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-31 00:56:18,943 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-31 00:56:19,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:19,136 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1765590153, now seen corresponding path program 1 times [2022-01-31 00:56:19,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:19,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863739141] [2022-01-31 00:56:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:19,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:19,168 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:56:19,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809852348] [2022-01-31 00:56:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:19,168 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:19,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:19,172 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-31 00:56:19,221 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-31 00:56:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:19,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-31 00:56:19,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:56:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:56:19,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 00:56:19,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:56:19,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863739141] [2022-01-31 00:56:19,291 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:56:19,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809852348] [2022-01-31 00:56:19,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809852348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 00:56:19,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 00:56:19,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 00:56:19,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406250992] [2022-01-31 00:56:19,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 00:56:19,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 00:56:19,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:56:19,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 00:56:19,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 00:56:19,295 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:56:19,369 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-01-31 00:56:19,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 00:56:19,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-01-31 00:56:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:56:19,377 INFO L225 Difference]: With dead ends: 71 [2022-01-31 00:56:19,378 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 00:56:19,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 00:56:19,382 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 00:56:19,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 00:56:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 00:56:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2022-01-31 00:56:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:56:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-01-31 00:56:19,396 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2022-01-31 00:56:19,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:56:19,396 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-01-31 00:56:19,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-01-31 00:56:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 00:56:19,397 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:19,397 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-31 00:56:19,417 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-31 00:56:19,599 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,SelfDestructingSolverStorable2 [2022-01-31 00:56:19,600 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1858974921, now seen corresponding path program 1 times [2022-01-31 00:56:19,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:19,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546578481] [2022-01-31 00:56:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:19,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:19,618 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:56:19,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [372232052] [2022-01-31 00:56:19,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:19,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:19,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:19,629 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-31 00:56:19,630 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-31 00:56:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:19,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-31 00:56:19,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:56:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:56:19,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:56:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:56:19,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:56:19,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546578481] [2022-01-31 00:56:19,821 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:56:19,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372232052] [2022-01-31 00:56:19,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372232052] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:56:19,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:56:19,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-01-31 00:56:19,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959516220] [2022-01-31 00:56:19,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:56:19,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 00:56:19,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:56:19,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 00:56:19,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-31 00:56:19,825 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:56:19,931 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-01-31 00:56:19,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 00:56:19,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-01-31 00:56:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:56:19,932 INFO L225 Difference]: With dead ends: 66 [2022-01-31 00:56:19,932 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 00:56:19,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-31 00:56:19,934 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:56:19,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 00:56:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 00:56:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-01-31 00:56:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:56:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-01-31 00:56:19,939 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2022-01-31 00:56:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:56:19,943 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-01-31 00:56:19,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-01-31 00:56:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 00:56:19,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:19,944 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, 1, 1] [2022-01-31 00:56:19,964 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-31 00:56:20,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:20,162 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:20,162 INFO L85 PathProgramCache]: Analyzing trace with hash -292108345, now seen corresponding path program 1 times [2022-01-31 00:56:20,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:20,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296661002] [2022-01-31 00:56:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:20,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:20,181 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:56:20,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380553250] [2022-01-31 00:56:20,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:20,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:20,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:20,183 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-31 00:56:20,184 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-31 00:56:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:20,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-31 00:56:20,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:56:20,293 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 10 treesize of output 8 [2022-01-31 00:56:20,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:56:20,300 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 14 treesize of output 14 [2022-01-31 00:56:20,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:56:20,322 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 14 treesize of output 16 [2022-01-31 00:56:20,367 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-01-31 00:56:20,368 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 21 treesize of output 20 [2022-01-31 00:56:20,410 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-01-31 00:56:20,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 27 [2022-01-31 00:56:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:56:20,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:56:20,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_126) c_main_~b~0.base) c_main_~b~0.offset) 1)) is different from false [2022-01-31 00:56:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 00:56:20,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:56:20,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296661002] [2022-01-31 00:56:20,679 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:56:20,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380553250] [2022-01-31 00:56:20,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380553250] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:56:20,679 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:56:20,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-01-31 00:56:20,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464397417] [2022-01-31 00:56:20,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:56:20,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 00:56:20,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:56:20,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 00:56:20,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2022-01-31 00:56:20,680 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:56:20,831 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-01-31 00:56:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 00:56:20,832 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-01-31 00:56:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:56:20,832 INFO L225 Difference]: With dead ends: 57 [2022-01-31 00:56:20,832 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 00:56:20,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=188, Unknown=1, NotChecked=28, Total=272 [2022-01-31 00:56:20,833 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 30 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:56:20,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 163 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-01-31 00:56:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 00:56:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-01-31 00:56:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:56:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-01-31 00:56:20,860 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 26 [2022-01-31 00:56:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:56:20,861 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-01-31 00:56:20,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-01-31 00:56:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 00:56:20,861 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:20,861 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:56:20,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-31 00:56:21,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:21,071 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:21,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1603857595, now seen corresponding path program 2 times [2022-01-31 00:56:21,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:21,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955283227] [2022-01-31 00:56:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:21,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:21,095 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:56:21,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006467497] [2022-01-31 00:56:21,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:56:21,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:21,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:21,096 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-31 00:56:21,098 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-31 00:56:21,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:56:21,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:56:21,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 00:56:21,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:56:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:56:21,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:56:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:56:21,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:56:21,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955283227] [2022-01-31 00:56:21,277 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:56:21,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006467497] [2022-01-31 00:56:21,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006467497] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:56:21,277 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:56:21,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 00:56:21,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440448101] [2022-01-31 00:56:21,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:56:21,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 00:56:21,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:56:21,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 00:56:21,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 00:56:21,278 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:56:21,444 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-01-31 00:56:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 00:56:21,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-01-31 00:56:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:56:21,445 INFO L225 Difference]: With dead ends: 88 [2022-01-31 00:56:21,446 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 00:56:21,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-01-31 00:56:21,447 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 44 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:56:21,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 139 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 00:56:21,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 00:56:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2022-01-31 00:56:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:56:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-01-31 00:56:21,453 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 28 [2022-01-31 00:56:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:56:21,453 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-01-31 00:56:21,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-01-31 00:56:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 00:56:21,454 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:21,454 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:56:21,474 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-31 00:56:21,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:21,668 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 376522627, now seen corresponding path program 3 times [2022-01-31 00:56:21,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:21,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481657492] [2022-01-31 00:56:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:21,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:21,689 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:56:21,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549345789] [2022-01-31 00:56:21,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 00:56:21,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:21,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:21,691 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-31 00:56:21,692 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-31 00:56:21,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 00:56:21,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:56:21,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-31 00:56:21,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:56:21,908 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-31 00:56:21,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2022-01-31 00:56:21,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:56:21,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:56:21,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:56:21,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 00:56:21,948 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 5 treesize of output 3 [2022-01-31 00:56:21,962 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 10 treesize of output 8 [2022-01-31 00:56:21,988 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 14 treesize of output 16 [2022-01-31 00:56:22,021 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 14 treesize of output 16 [2022-01-31 00:56:22,090 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 57 treesize of output 50 [2022-01-31 00:56:22,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:56:22,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:56:22,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:56:22,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 00:56:22,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:56:22,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2022-01-31 00:56:22,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:56:22,145 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 21 treesize of output 20 [2022-01-31 00:56:22,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:56:22,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:56:22,187 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:56:22,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 27 [2022-01-31 00:56:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:56:22,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:56:22,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_208 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_208) c_main_~b~0.base) c_main_~b~0.offset) 1)) is different from false [2022-01-31 00:56:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-01-31 00:56:22,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:56:22,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481657492] [2022-01-31 00:56:22,556 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:56:22,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549345789] [2022-01-31 00:56:22,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549345789] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:56:22,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:56:22,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-01-31 00:56:22,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553820158] [2022-01-31 00:56:22,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:56:22,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 00:56:22,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:56:22,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 00:56:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=212, Unknown=1, NotChecked=30, Total=306 [2022-01-31 00:56:22,558 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 18 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:56:22,830 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-01-31 00:56:22,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 00:56:22,830 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-01-31 00:56:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:56:22,831 INFO L225 Difference]: With dead ends: 83 [2022-01-31 00:56:22,831 INFO L226 Difference]: Without dead ends: 81 [2022-01-31 00:56:22,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=481, Unknown=2, NotChecked=46, Total=650 [2022-01-31 00:56:22,832 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:56:22,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 239 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 129 Unchecked, 0.1s Time] [2022-01-31 00:56:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-31 00:56:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2022-01-31 00:56:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 45 states have internal predecessors, (52), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:56:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-01-31 00:56:22,838 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 30 [2022-01-31 00:56:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:56:22,839 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-01-31 00:56:22,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-01-31 00:56:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 00:56:22,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:22,839 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:56:22,859 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-31 00:56:23,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:23,040 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:23,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2143768931, now seen corresponding path program 1 times [2022-01-31 00:56:23,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:23,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37238993] [2022-01-31 00:56:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:23,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:23,053 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:56:23,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935762064] [2022-01-31 00:56:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:23,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:23,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:23,055 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-31 00:56:23,056 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-31 00:56:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:23,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 00:56:23,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:56:23,164 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 10 treesize of output 8 [2022-01-31 00:56:23,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:56:23,169 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-01-31 00:56:23,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:56:23,180 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 19 treesize of output 18 [2022-01-31 00:56:23,203 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-01-31 00:56:23,203 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 1 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 00:56:23,242 INFO L353 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-01-31 00:56:23,242 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 1 case distinctions, treesize of input 38 treesize of output 32 [2022-01-31 00:56:23,570 INFO L353 Elim1Store]: treesize reduction 91, result has 3.2 percent of original size [2022-01-31 00:56:23,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 35 [2022-01-31 00:56:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:56:23,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:56:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:56:24,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:56:24,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37238993] [2022-01-31 00:56:24,179 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:56:24,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935762064] [2022-01-31 00:56:24,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935762064] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:56:24,179 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:56:24,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-01-31 00:56:24,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956313410] [2022-01-31 00:56:24,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:56:24,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 00:56:24,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:56:24,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 00:56:24,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-01-31 00:56:24,180 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 18 states, 16 states have (on average 2.625) internal successors, (42), 17 states have internal predecessors, (42), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 00:56:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:56:26,430 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-01-31 00:56:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 00:56:26,430 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.625) internal successors, (42), 17 states have internal predecessors, (42), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-01-31 00:56:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:56:26,431 INFO L225 Difference]: With dead ends: 70 [2022-01-31 00:56:26,431 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 00:56:26,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=85, Invalid=420, Unknown=1, NotChecked=0, Total=506 [2022-01-31 00:56:26,432 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:56:26,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 250 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-01-31 00:56:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 00:56:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-01-31 00:56:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 00:56:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-01-31 00:56:26,440 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 34 [2022-01-31 00:56:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:56:26,440 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-01-31 00:56:26,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.625) internal successors, (42), 17 states have internal predecessors, (42), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 00:56:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-01-31 00:56:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 00:56:26,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:26,442 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:56:26,477 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-31 00:56:26,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:26,643 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:26,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash -768689921, now seen corresponding path program 4 times [2022-01-31 00:56:26,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:26,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23410592] [2022-01-31 00:56:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:26,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:26,675 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:56:26,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941429719] [2022-01-31 00:56:26,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 00:56:26,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:26,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:26,678 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-31 00:56:26,679 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-31 00:56:26,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 00:56:26,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:56:26,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 00:56:26,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:56:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 00:56:26,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:56:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 00:56:26,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:56:26,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23410592] [2022-01-31 00:56:26,924 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:56:26,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941429719] [2022-01-31 00:56:26,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941429719] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:56:26,924 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:56:26,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 00:56:26,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533242742] [2022-01-31 00:56:26,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:56:26,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 00:56:26,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:56:26,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 00:56:26,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 00:56:26,926 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:56:27,259 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2022-01-31 00:56:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 00:56:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-01-31 00:56:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:56:27,260 INFO L225 Difference]: With dead ends: 130 [2022-01-31 00:56:27,260 INFO L226 Difference]: Without dead ends: 88 [2022-01-31 00:56:27,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2022-01-31 00:56:27,261 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:56:27,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 165 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 00:56:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-31 00:56:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 59. [2022-01-31 00:56:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 00:56:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-01-31 00:56:27,268 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 34 [2022-01-31 00:56:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:56:27,268 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-01-31 00:56:27,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:56:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-01-31 00:56:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 00:56:27,269 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:27,269 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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-31 00:56:27,290 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-31 00:56:27,484 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,SelfDestructingSolverStorable8 [2022-01-31 00:56:27,485 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:27,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2094692671, now seen corresponding path program 5 times [2022-01-31 00:56:27,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:27,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320278003] [2022-01-31 00:56:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:27,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:27,501 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:56:27,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270369749] [2022-01-31 00:56:27,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 00:56:27,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:27,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:27,503 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-31 00:56:27,504 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-31 00:57:15,917 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 00:57:15,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:57:16,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-31 00:57:16,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:57:16,122 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-31 00:57:16,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2022-01-31 00:57:16,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:57:16,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:57:16,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 00:57:16,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 00:57:16,200 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 5 treesize of output 3 [2022-01-31 00:57:16,211 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 10 treesize of output 8 [2022-01-31 00:57:16,235 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 14 treesize of output 16 [2022-01-31 00:57:16,271 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 14 treesize of output 16 [2022-01-31 00:57:16,301 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 14 treesize of output 16 [2022-01-31 00:57:16,346 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 57 treesize of output 50 [2022-01-31 00:57:16,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:16,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:16,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:16,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 00:57:16,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:16,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2022-01-31 00:57:16,409 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 57 treesize of output 50 [2022-01-31 00:57:16,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:16,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:16,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:16,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 00:57:16,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:16,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2022-01-31 00:57:16,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:16,469 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 21 treesize of output 20 [2022-01-31 00:57:16,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:16,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:57:16,507 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:57:16,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 27 [2022-01-31 00:57:16,541 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-31 00:57:16,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:57:17,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_353 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_353) c_main_~b~0.base) c_main_~b~0.offset) 1)) is different from false [2022-01-31 00:57:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2022-01-31 00:57:17,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:57:17,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320278003] [2022-01-31 00:57:17,246 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:57:17,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270369749] [2022-01-31 00:57:17,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270369749] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:57:17,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:57:17,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-01-31 00:57:17,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179060451] [2022-01-31 00:57:17,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:57:17,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 00:57:17,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:57:17,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 00:57:17,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=322, Unknown=1, NotChecked=38, Total=462 [2022-01-31 00:57:17,249 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 22 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:57:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:57:17,800 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2022-01-31 00:57:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 00:57:17,801 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-01-31 00:57:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:57:17,802 INFO L225 Difference]: With dead ends: 98 [2022-01-31 00:57:17,802 INFO L226 Difference]: Without dead ends: 96 [2022-01-31 00:57:17,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=597, Unknown=1, NotChecked=52, Total=812 [2022-01-31 00:57:17,803 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 49 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 00:57:17,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 270 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 275 Invalid, 0 Unknown, 136 Unchecked, 0.3s Time] [2022-01-31 00:57:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-01-31 00:57:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2022-01-31 00:57:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 00:57:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-01-31 00:57:17,810 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 34 [2022-01-31 00:57:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:57:17,811 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-01-31 00:57:17,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:57:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-01-31 00:57:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 00:57:17,811 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:57:17,811 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:57:17,823 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-31 00:57:18,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 00:57:18,021 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:57:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:57:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1519271003, now seen corresponding path program 2 times [2022-01-31 00:57:18,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:57:18,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312733486] [2022-01-31 00:57:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:57:18,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:57:18,035 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:57:18,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764173645] [2022-01-31 00:57:18,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:57:18,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:57:18,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:57:18,036 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-31 00:57:18,037 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-31 00:57:18,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:57:18,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:57:18,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 00:57:18,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:57:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:57:18,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:57:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 00:57:18,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:57:18,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312733486] [2022-01-31 00:57:18,240 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:57:18,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764173645] [2022-01-31 00:57:18,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764173645] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:57:18,240 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:57:18,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 00:57:18,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865181796] [2022-01-31 00:57:18,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:57:18,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 00:57:18,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:57:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 00:57:18,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 00:57:18,241 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 00:57:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:57:18,362 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-01-31 00:57:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 00:57:18,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-01-31 00:57:18,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:57:18,365 INFO L225 Difference]: With dead ends: 90 [2022-01-31 00:57:18,365 INFO L226 Difference]: Without dead ends: 73 [2022-01-31 00:57:18,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-01-31 00:57:18,379 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 33 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:57:18,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 00:57:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-31 00:57:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2022-01-31 00:57:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:57:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-01-31 00:57:18,384 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 36 [2022-01-31 00:57:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:57:18,385 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-01-31 00:57:18,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 00:57:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-01-31 00:57:18,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 00:57:18,385 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:57:18,385 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:57:18,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 00:57:18,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-31 00:57:18,586 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:57:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:57:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash 56996441, now seen corresponding path program 3 times [2022-01-31 00:57:18,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:57:18,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012378193] [2022-01-31 00:57:18,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:57:18,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:57:18,617 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:57:18,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564990700] [2022-01-31 00:57:18,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 00:57:18,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:57:18,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:57:18,619 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:57:18,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 00:57:18,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 00:57:18,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:57:18,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-31 00:57:18,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:57:18,851 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-31 00:57:18,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-01-31 00:57:18,877 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-01-31 00:57:18,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2022-01-31 00:57:18,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:57:18,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:18,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-31 00:57:18,929 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 5 treesize of output 3 [2022-01-31 00:57:18,956 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 8 treesize of output 6 [2022-01-31 00:57:18,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:57:18,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 30 treesize of output 31 [2022-01-31 00:57:19,012 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 10 treesize of output 8 [2022-01-31 00:57:19,047 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 0 case distinctions, treesize of input 64 treesize of output 60 [2022-01-31 00:57:19,062 INFO L353 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2022-01-31 00:57:19,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 00:57:19,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2022-01-31 00:57:19,113 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 0 case distinctions, treesize of input 64 treesize of output 60 [2022-01-31 00:57:19,127 INFO L353 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2022-01-31 00:57:19,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 00:57:19,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2022-01-31 00:57:19,245 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 0 case distinctions, treesize of input 142 treesize of output 130 [2022-01-31 00:57:19,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:57:19,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 158 [2022-01-31 00:57:19,304 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 00:57:19,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 50 [2022-01-31 00:57:19,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2022-01-31 00:57:19,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:19,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:57:19,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 32 [2022-01-31 00:57:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:57:19,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:57:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:57:22,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:57:22,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012378193] [2022-01-31 00:57:22,779 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:57:22,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564990700] [2022-01-31 00:57:22,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564990700] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:57:22,779 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:57:22,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2022-01-31 00:57:22,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562874052] [2022-01-31 00:57:22,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:57:22,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 00:57:22,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:57:22,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 00:57:22,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2022-01-31 00:57:22,781 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 29 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 states have internal predecessors, (50), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 00:57:23,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:57:23,001 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-01-31 00:57:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 00:57:23,015 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 states have internal predecessors, (50), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-01-31 00:57:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:57:23,018 INFO L225 Difference]: With dead ends: 91 [2022-01-31 00:57:23,018 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 00:57:23,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 00:57:23,019 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:57:23,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 286 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-01-31 00:57:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 00:57:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-01-31 00:57:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 72 states have internal predecessors, (81), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 00:57:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-01-31 00:57:23,035 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 38 [2022-01-31 00:57:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:57:23,035 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-01-31 00:57:23,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 states have internal predecessors, (50), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 00:57:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-01-31 00:57:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 00:57:23,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:57:23,040 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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-31 00:57:23,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 00:57:23,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 00:57:23,259 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:57:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:57:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash 467372857, now seen corresponding path program 6 times [2022-01-31 00:57:23,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:57:23,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094858320] [2022-01-31 00:57:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:57:23,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:57:23,275 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:57:23,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384275585] [2022-01-31 00:57:23,276 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 00:57:23,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:57:23,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:57:23,277 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:57:23,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 00:57:24,756 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-31 00:57:24,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:57:24,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 00:57:24,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:57:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 00:57:24,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:57:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 00:57:24,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:57:24,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094858320] [2022-01-31 00:57:24,968 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:57:24,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384275585] [2022-01-31 00:57:24,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384275585] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:57:24,969 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:57:24,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 00:57:24,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775696573] [2022-01-31 00:57:24,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:57:24,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 00:57:24,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:57:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 00:57:24,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 00:57:24,971 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:57:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:57:25,407 INFO L93 Difference]: Finished difference Result 172 states and 197 transitions. [2022-01-31 00:57:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 00:57:25,409 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-01-31 00:57:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:57:25,410 INFO L225 Difference]: With dead ends: 172 [2022-01-31 00:57:25,410 INFO L226 Difference]: Without dead ends: 145 [2022-01-31 00:57:25,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=680, Unknown=0, NotChecked=0, Total=930 [2022-01-31 00:57:25,411 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 115 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:57:25,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 158 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 00:57:25,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-31 00:57:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2022-01-31 00:57:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.134020618556701) internal successors, (110), 101 states have internal predecessors, (110), 13 states have call successors, (13), 9 states have call predecessors, (13), 7 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 00:57:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2022-01-31 00:57:25,425 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 40 [2022-01-31 00:57:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:57:25,425 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2022-01-31 00:57:25,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:57:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2022-01-31 00:57:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 00:57:25,426 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:57:25,426 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:57:25,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 00:57:25,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 00:57:25,626 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:57:25,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:57:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash -330340331, now seen corresponding path program 4 times [2022-01-31 00:57:25,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:57:25,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787278842] [2022-01-31 00:57:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:57:25,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:57:25,654 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:57:25,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171191895] [2022-01-31 00:57:25,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 00:57:25,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:57:25,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:57:25,668 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:57:25,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 00:57:26,226 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 00:57:26,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:57:26,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-31 00:57:26,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:57:26,256 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 10 treesize of output 8 [2022-01-31 00:57:26,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,264 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-01-31 00:57:26,267 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 0 case distinctions, treesize of input 20 treesize of output 20 [2022-01-31 00:57:26,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:57:26,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:57:26,311 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:57:26,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2022-01-31 00:57:26,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 00:57:26,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2022-01-31 00:57:26,375 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:57:26,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2022-01-31 00:57:26,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 00:57:26,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2022-01-31 00:57:26,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,446 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 00:57:26,446 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 1 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 00:57:26,516 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:57:26,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 127 [2022-01-31 00:57:26,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:57:26,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 155 [2022-01-31 00:57:26,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 64 [2022-01-31 00:57:26,671 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:57:26,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 101 [2022-01-31 00:57:26,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 118 [2022-01-31 00:57:26,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 52 [2022-01-31 00:57:26,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,774 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 00:57:26,774 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 47 treesize of output 44 [2022-01-31 00:57:26,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:57:26,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:26,982 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-31 00:57:26,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 39 [2022-01-31 00:57:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:57:27,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:57:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:57:47,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:57:47,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787278842] [2022-01-31 00:57:47,150 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:57:47,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171191895] [2022-01-31 00:57:47,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171191895] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:57:47,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:57:47,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 30 [2022-01-31 00:57:47,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930370980] [2022-01-31 00:57:47,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:57:47,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 00:57:47,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:57:47,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 00:57:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=735, Unknown=5, NotChecked=0, Total=870 [2022-01-31 00:57:47,153 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand has 30 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 00:57:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:57:53,078 INFO L93 Difference]: Finished difference Result 168 states and 194 transitions. [2022-01-31 00:57:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 00:57:53,080 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2022-01-31 00:57:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:57:53,081 INFO L225 Difference]: With dead ends: 168 [2022-01-31 00:57:53,081 INFO L226 Difference]: Without dead ends: 166 [2022-01-31 00:57:53,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=197, Invalid=1201, Unknown=8, NotChecked=0, Total=1406 [2022-01-31 00:57:53,082 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:57:53,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 315 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 145 Unchecked, 0.1s Time] [2022-01-31 00:57:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-01-31 00:57:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 139. [2022-01-31 00:57:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 113 states have (on average 1.1327433628318584) internal successors, (128), 120 states have internal predecessors, (128), 17 states have call successors, (17), 10 states have call predecessors, (17), 8 states have return successors, (15), 8 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-31 00:57:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2022-01-31 00:57:53,106 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 42 [2022-01-31 00:57:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:57:53,107 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2022-01-31 00:57:53,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 00:57:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2022-01-31 00:57:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 00:57:53,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:57:53,108 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:57:53,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 00:57:53,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 00:57:53,324 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:57:53,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:57:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash 871584375, now seen corresponding path program 7 times [2022-01-31 00:57:53,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:57:53,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500212992] [2022-01-31 00:57:53,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:57:53,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:57:53,367 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:57:53,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683238180] [2022-01-31 00:57:53,367 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 00:57:53,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:57:53,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:57:53,370 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:57:53,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 00:57:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:57:53,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 00:57:53,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:57:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 00:57:53,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:57:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 00:57:53,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:57:53,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500212992] [2022-01-31 00:57:53,664 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:57:53,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683238180] [2022-01-31 00:57:53,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683238180] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:57:53,664 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:57:53,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-01-31 00:57:53,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066408325] [2022-01-31 00:57:53,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:57:53,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 00:57:53,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:57:53,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 00:57:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-01-31 00:57:53,665 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:57:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:57:54,419 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2022-01-31 00:57:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 00:57:54,420 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-01-31 00:57:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:57:54,421 INFO L225 Difference]: With dead ends: 241 [2022-01-31 00:57:54,421 INFO L226 Difference]: Without dead ends: 208 [2022-01-31 00:57:54,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=497, Invalid=1483, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 00:57:54,422 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 199 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 00:57:54,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 184 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 00:57:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-01-31 00:57:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 149. [2022-01-31 00:57:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.1382113821138211) internal successors, (140), 130 states have internal predecessors, (140), 17 states have call successors, (17), 10 states have call predecessors, (17), 8 states have return successors, (15), 8 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-31 00:57:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2022-01-31 00:57:54,443 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 42 [2022-01-31 00:57:54,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:57:54,443 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2022-01-31 00:57:54,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:57:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2022-01-31 00:57:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 00:57:54,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:57:54,444 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2022-01-31 00:57:54,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-31 00:57:54,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:57:54,662 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:57:54,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:57:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash 59041583, now seen corresponding path program 5 times [2022-01-31 00:57:54,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:57:54,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649805776] [2022-01-31 00:57:54,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:57:54,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:57:54,679 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:57:54,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1994632602] [2022-01-31 00:57:54,679 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 00:57:54,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:57:54,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:57:54,696 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:57:54,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 00:57:59,713 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-31 00:57:59,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:57:59,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-31 00:57:59,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:57:59,746 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 10 treesize of output 8 [2022-01-31 00:57:59,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,756 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-01-31 00:57:59,760 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 0 case distinctions, treesize of input 20 treesize of output 20 [2022-01-31 00:57:59,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:57:59,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:57:59,809 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:57:59,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 109 [2022-01-31 00:57:59,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:57:59,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 133 [2022-01-31 00:57:59,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 36 [2022-01-31 00:57:59,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:59,922 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 00:57:59,922 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 37 treesize of output 42 [2022-01-31 00:58:00,000 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:58:00,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 149 [2022-01-31 00:58:00,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:00,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 158 [2022-01-31 00:58:00,041 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 00:58:00,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 50 [2022-01-31 00:58:00,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:00,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:00,138 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-31 00:58:00,138 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 62 treesize of output 56 [2022-01-31 00:58:04,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:04,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:04,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:04,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:04,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:04,259 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-31 00:58:04,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 88 treesize of output 49 [2022-01-31 00:58:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:58:04,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:58:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:58:21,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:58:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649805776] [2022-01-31 00:58:21,571 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:58:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994632602] [2022-01-31 00:58:21,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994632602] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:58:21,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:58:21,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2022-01-31 00:58:21,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886379428] [2022-01-31 00:58:21,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:58:21,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 00:58:21,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:58:21,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 00:58:21,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=645, Unknown=3, NotChecked=0, Total=756 [2022-01-31 00:58:21,573 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 7 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 00:58:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:58:25,253 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2022-01-31 00:58:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 00:58:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 7 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2022-01-31 00:58:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:58:25,254 INFO L225 Difference]: With dead ends: 173 [2022-01-31 00:58:25,254 INFO L226 Difference]: Without dead ends: 133 [2022-01-31 00:58:25,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=211, Invalid=1191, Unknown=4, NotChecked=0, Total=1406 [2022-01-31 00:58:25,255 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 00:58:25,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 334 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 202 Invalid, 0 Unknown, 158 Unchecked, 0.5s Time] [2022-01-31 00:58:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-31 00:58:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-01-31 00:58:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 115 states have internal predecessors, (125), 15 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-31 00:58:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2022-01-31 00:58:25,285 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 46 [2022-01-31 00:58:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:58:25,285 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2022-01-31 00:58:25,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 7 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 00:58:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2022-01-31 00:58:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 00:58:25,286 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:58:25,286 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:58:25,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 00:58:25,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-31 00:58:25,493 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:58:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:58:25,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1523170763, now seen corresponding path program 8 times [2022-01-31 00:58:25,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:58:25,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454500571] [2022-01-31 00:58:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:58:25,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:58:25,508 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:58:25,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594487825] [2022-01-31 00:58:25,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:58:25,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:58:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:58:25,509 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:58:25,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 00:58:25,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:58:25,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:58:25,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 00:58:25,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:58:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:58:25,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:58:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:58:25,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:58:25,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454500571] [2022-01-31 00:58:25,883 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:58:25,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594487825] [2022-01-31 00:58:25,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594487825] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:58:25,883 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:58:25,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2022-01-31 00:58:25,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735130526] [2022-01-31 00:58:25,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:58:25,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 00:58:25,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:58:25,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 00:58:25,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-01-31 00:58:25,884 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:58:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:58:26,794 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2022-01-31 00:58:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-31 00:58:26,794 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 00:58:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:58:26,795 INFO L225 Difference]: With dead ends: 233 [2022-01-31 00:58:26,795 INFO L226 Difference]: Without dead ends: 217 [2022-01-31 00:58:26,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=802, Invalid=2620, Unknown=0, NotChecked=0, Total=3422 [2022-01-31 00:58:26,797 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 243 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 00:58:26,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 209 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 00:58:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-01-31 00:58:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 164. [2022-01-31 00:58:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 134 states have (on average 1.126865671641791) internal successors, (151), 140 states have internal predecessors, (151), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 00:58:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 190 transitions. [2022-01-31 00:58:26,838 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 190 transitions. Word has length 44 [2022-01-31 00:58:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:58:26,838 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 190 transitions. [2022-01-31 00:58:26,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:58:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 190 transitions. [2022-01-31 00:58:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 00:58:26,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:58:26,839 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:58:26,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 00:58:27,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 00:58:27,056 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:58:27,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:58:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1439748049, now seen corresponding path program 6 times [2022-01-31 00:58:27,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:58:27,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199280546] [2022-01-31 00:58:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:58:27,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:58:27,097 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:58:27,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462967893] [2022-01-31 00:58:27,097 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 00:58:27,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:58:27,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:58:27,103 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:58:27,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 00:58:28,742 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 00:58:28,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:58:28,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 76 conjunts are in the unsatisfiable core [2022-01-31 00:58:28,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:58:28,782 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 10 treesize of output 8 [2022-01-31 00:58:28,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:28,791 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-01-31 00:58:28,794 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 0 case distinctions, treesize of input 20 treesize of output 20 [2022-01-31 00:58:28,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:58:28,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:58:28,866 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:58:28,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 109 [2022-01-31 00:58:28,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:28,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:28,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:28,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:28,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:28,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:28,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:28,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 133 [2022-01-31 00:58:28,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:28,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:28,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:28,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 63 [2022-01-31 00:58:29,044 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:58:29,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 142 [2022-01-31 00:58:29,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 164 [2022-01-31 00:58:29,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 96 [2022-01-31 00:58:29,214 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:58:29,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 80 [2022-01-31 00:58:29,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 97 [2022-01-31 00:58:29,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 31 [2022-01-31 00:58:29,363 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:58:29,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 80 [2022-01-31 00:58:29,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 97 [2022-01-31 00:58:29,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 43 [2022-01-31 00:58:29,642 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:58:29,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 168 treesize of output 150 [2022-01-31 00:58:29,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:29,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 158 [2022-01-31 00:58:29,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 39 [2022-01-31 00:58:29,810 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:58:29,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 182 [2022-01-31 00:58:29,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 196 [2022-01-31 00:58:29,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:29,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 102 [2022-01-31 00:58:30,093 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:58:30,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 103 [2022-01-31 00:58:30,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 112 [2022-01-31 00:58:30,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 58 [2022-01-31 00:58:30,257 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 00:58:30,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 103 [2022-01-31 00:58:30,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 112 [2022-01-31 00:58:30,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:30,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 58 [2022-01-31 00:58:34,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:34,508 INFO L353 Elim1Store]: treesize reduction 28, result has 22.2 percent of original size [2022-01-31 00:58:34,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 53 [2022-01-31 00:58:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:58:34,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:59:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:59:03,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:59:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199280546] [2022-01-31 00:59:03,764 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:59:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462967893] [2022-01-31 00:59:03,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462967893] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:59:03,764 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:59:03,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2022-01-31 00:59:03,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594669785] [2022-01-31 00:59:03,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:59:03,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-31 00:59:03,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:59:03,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-31 00:59:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=1997, Unknown=8, NotChecked=0, Total=2450 [2022-01-31 00:59:03,766 INFO L87 Difference]: Start difference. First operand 164 states and 190 transitions. Second operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 6 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 00:59:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:59:22,064 INFO L93 Difference]: Finished difference Result 222 states and 260 transitions. [2022-01-31 00:59:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-31 00:59:22,065 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 6 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 46 [2022-01-31 00:59:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:59:22,065 INFO L225 Difference]: With dead ends: 222 [2022-01-31 00:59:22,066 INFO L226 Difference]: Without dead ends: 220 [2022-01-31 00:59:22,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=691, Invalid=3070, Unknown=21, NotChecked=0, Total=3782 [2022-01-31 00:59:22,067 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:59:22,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 451 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 98 Unchecked, 0.2s Time] [2022-01-31 00:59:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-01-31 00:59:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 206. [2022-01-31 00:59:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 169 states have (on average 1.136094674556213) internal successors, (192), 178 states have internal predecessors, (192), 26 states have call successors, (26), 13 states have call predecessors, (26), 10 states have return successors, (23), 14 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-31 00:59:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 241 transitions. [2022-01-31 00:59:22,093 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 241 transitions. Word has length 46 [2022-01-31 00:59:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:59:22,093 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 241 transitions. [2022-01-31 00:59:22,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 6 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 00:59:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 241 transitions. [2022-01-31 00:59:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 00:59:22,094 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:59:22,094 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:59:22,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-01-31 00:59:22,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 00:59:22,302 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:59:22,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:59:22,302 INFO L85 PathProgramCache]: Analyzing trace with hash 776134737, now seen corresponding path program 7 times [2022-01-31 00:59:22,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:59:22,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000507086] [2022-01-31 00:59:22,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:59:22,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:59:22,314 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:59:22,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706458139] [2022-01-31 00:59:22,315 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 00:59:22,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:59:22,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:59:22,322 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:59:22,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-31 00:59:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:59:22,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-31 00:59:22,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:59:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:59:22,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:59:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 00:59:22,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:59:22,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000507086] [2022-01-31 00:59:22,638 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 00:59:22,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706458139] [2022-01-31 00:59:22,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706458139] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:59:22,638 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 00:59:22,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-01-31 00:59:22,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992432406] [2022-01-31 00:59:22,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 00:59:22,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 00:59:22,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:59:22,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 00:59:22,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-01-31 00:59:22,639 INFO L87 Difference]: Start difference. First operand 206 states and 241 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 00:59:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:59:23,504 INFO L93 Difference]: Finished difference Result 319 states and 367 transitions. [2022-01-31 00:59:23,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 00:59:23,505 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-31 00:59:23,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:59:23,506 INFO L225 Difference]: With dead ends: 319 [2022-01-31 00:59:23,506 INFO L226 Difference]: Without dead ends: 232 [2022-01-31 00:59:23,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=547, Invalid=1523, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 00:59:23,507 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 121 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 00:59:23,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 228 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 00:59:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-01-31 00:59:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 165. [2022-01-31 00:59:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.0808823529411764) internal successors, (147), 138 states have internal predecessors, (147), 20 states have call successors, (20), 11 states have call predecessors, (20), 8 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-01-31 00:59:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 184 transitions. [2022-01-31 00:59:23,542 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 184 transitions. Word has length 46 [2022-01-31 00:59:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:59:23,543 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 184 transitions. [2022-01-31 00:59:23,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 00:59:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 184 transitions. [2022-01-31 00:59:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 00:59:23,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:59:23,543 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:59:23,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-31 00:59:23,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:59:23,761 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:59:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:59:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash -780387725, now seen corresponding path program 9 times [2022-01-31 00:59:23,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:59:23,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775222138] [2022-01-31 00:59:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:59:23,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:59:23,775 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 00:59:23,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102388120] [2022-01-31 00:59:23,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 00:59:23,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:59:23,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:59:23,776 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:59:23,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-31 00:59:26,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-01-31 00:59:26,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:59:26,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-31 00:59:26,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:59:26,521 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 10 treesize of output 8 [2022-01-31 00:59:26,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,528 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 14 treesize of output 14 [2022-01-31 00:59:26,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 00:59:26,551 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 14 treesize of output 16 [2022-01-31 00:59:26,584 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 14 treesize of output 16 [2022-01-31 00:59:26,612 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 14 treesize of output 16 [2022-01-31 00:59:26,631 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 14 treesize of output 16 [2022-01-31 00:59:26,650 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 14 treesize of output 16 [2022-01-31 00:59:26,671 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 14 treesize of output 16 [2022-01-31 00:59:26,761 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 57 treesize of output 50 [2022-01-31 00:59:26,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 00:59:26,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2022-01-31 00:59:26,833 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 57 treesize of output 50 [2022-01-31 00:59:26,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 00:59:26,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2022-01-31 00:59:26,910 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 57 treesize of output 50 [2022-01-31 00:59:26,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 00:59:26,919 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 00:59:26,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2022-01-31 00:59:26,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:26,972 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 21 treesize of output 20 [2022-01-31 00:59:27,011 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 57 treesize of output 50 [2022-01-31 00:59:27,030 INFO L353 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-01-31 00:59:27,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 69 [2022-01-31 00:59:27,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:27,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2022-01-31 00:59:27,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:27,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2022-01-31 00:59:27,150 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 67 treesize of output 60 [2022-01-31 00:59:27,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:27,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:27,165 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 00:59:27,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 79 [2022-01-31 00:59:27,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:27,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2022-01-31 00:59:27,218 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 00:59:27,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:27,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2022-01-31 00:59:27,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:27,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2022-01-31 00:59:27,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:59:27,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:59:27,421 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:59:27,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 27 [2022-01-31 00:59:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 00:59:27,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:59:29,915 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse0 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (<= c_~N~0 (+ .cse0 1 aux_mod_main_~i~0_26)) (< (+ .cse0 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26))))) is different from false [2022-01-31 00:59:32,406 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (let ((.cse0 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (or (not .cse0) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or .cse0 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse3 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (let ((.cse2 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (or .cse2 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= 1 (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset)))) (or (not .cse2) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse3 1 aux_mod_main_~i~0_26)) (< (+ .cse3 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26))))) is different from false [2022-01-31 00:59:34,438 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse0 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse0 1 aux_mod_main_~i~0_26)) (let ((.cse1 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse1)) (or .cse1 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (< (+ .cse0 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse2 (* 4294967296 aux_div_main_~i~0_26))) (or (<= c_~N~0 (+ .cse2 1 aux_mod_main_~i~0_26)) (let ((.cse3 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (not .cse3) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or .cse3 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (< (+ .cse2 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26))))) is different from false [2022-01-31 00:59:37,372 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (or .cse0 (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (let ((.cse2 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or .cse2 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse2)))) (< 2147483647 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse4 (* 4294967296 aux_div_main_~i~0_26))) (or (let ((.cse3 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse3)) (or .cse3 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse4 1 aux_mod_main_~i~0_26)) (< (+ .cse4 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))))) (or (not .cse0) (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse5 (* 4294967296 aux_div_main_~i~0_26))) (or (<= c_~N~0 (+ .cse5 1 aux_mod_main_~i~0_26)) (let ((.cse6 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or .cse6 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse6)))) (< (+ .cse5 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse7 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse7 1 aux_mod_main_~i~0_26)) (< (+ .cse7 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26) (let ((.cse8 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse8)) (or .cse8 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)))))))))))) is different from false [2022-01-31 01:00:33,071 WARN L228 SmtUtils]: Spent 33.40s on a formula simplification. DAG size of input: 121 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:01:49,554 WARN L228 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 130 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:02:03,596 WARN L228 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:02:38,542 WARN L228 SmtUtils]: Spent 21.91s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:02:47,106 WARN L228 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:02:56,192 WARN L228 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:03:03,442 WARN L228 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:03:03,514 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_963 (Array Int Int)) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse0 (* 4294967296 aux_div_main_~i~0_26))) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_965 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (store (store (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_963) c_main_~b~0.base) (+ 8 c_main_~b~0.offset) v_ArrVal_965) (+ 16 c_main_~b~0.offset) v_ArrVal_967) (+ c_main_~b~0.offset 24) v_ArrVal_969) (+ 32 c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (<= c_~N~0 (+ .cse0 1 aux_mod_main_~i~0_26)) (< (+ .cse0 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (forall ((v_ArrVal_963 (Array Int Int)) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_965 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (store (store (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_963) c_main_~b~0.base) (+ 8 c_main_~b~0.offset) v_ArrVal_965) (+ 16 c_main_~b~0.offset) v_ArrVal_967) (+ c_main_~b~0.offset 24) v_ArrVal_969) (+ 32 c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)))))) (<= c_~N~0 2)) is different from false [2022-01-31 01:03:04,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:03:04,188 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 125 treesize of output 121 [2022-01-31 01:03:04,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:03:04,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:03:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 10 refuted. 2 times theorem prover too weak. 25 trivial. 35 not checked. [2022-01-31 01:03:04,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:03:04,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775222138] [2022-01-31 01:03:04,780 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:03:04,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102388120] [2022-01-31 01:03:04,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102388120] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:03:04,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:03:04,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 45 [2022-01-31 01:03:04,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905168350] [2022-01-31 01:03:04,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:03:04,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-31 01:03:04,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:03:04,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-31 01:03:04,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1224, Unknown=27, NotChecked=400, Total=1980 [2022-01-31 01:03:04,782 INFO L87 Difference]: Start difference. First operand 165 states and 184 transitions. Second operand has 45 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 01:03:10,457 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1))) (and (< 2 c_~N~0) (= 1 (+ (- 1) c_main_~i~0)) .cse0 (or .cse0 (= (* (mod c_main_~i~0 4294967296) 8) 0)) (< c_main_~i~0 c_~N~0) (= c_main_~b~0.offset 0) (<= c_~N~0 2147483647) (or (and (forall ((v_ArrVal_963 (Array Int Int)) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_965 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (store (store (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_963) c_main_~b~0.base) (+ 8 c_main_~b~0.offset) v_ArrVal_965) (+ 16 c_main_~b~0.offset) v_ArrVal_967) (+ c_main_~b~0.offset 24) v_ArrVal_969) (+ 32 c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (forall ((v_ArrVal_963 (Array Int Int)) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse2 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse2 1 aux_mod_main_~i~0_26)) (< (+ .cse2 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_965 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (store (store (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_963) c_main_~b~0.base) (+ 8 c_main_~b~0.offset) v_ArrVal_965) (+ 16 c_main_~b~0.offset) v_ArrVal_967) (+ c_main_~b~0.offset 24) v_ArrVal_969) (+ 32 c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)))))) (<= c_~N~0 2)) (not (= c_main_~b~0.base c_main_~a~0.base)))) is different from false [2022-01-31 01:03:15,986 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (< 2 c_~N~0) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= c_main_~i~0 3) (= c_main_~b~0.offset 0) (<= c_~N~0 2147483647) (or .cse0 (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (let ((.cse2 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or .cse2 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse2)))) (< 2147483647 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse4 (* 4294967296 aux_div_main_~i~0_26))) (or (let ((.cse3 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse3)) (or .cse3 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse4 1 aux_mod_main_~i~0_26)) (< (+ .cse4 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))))) (or (not .cse0) (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse5 (* 4294967296 aux_div_main_~i~0_26))) (or (<= c_~N~0 (+ .cse5 1 aux_mod_main_~i~0_26)) (let ((.cse6 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or .cse6 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse6)))) (< (+ .cse5 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse7 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse7 1 aux_mod_main_~i~0_26)) (< (+ .cse7 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26) (let ((.cse8 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse8)) (or .cse8 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)))))))))) (not (= c_main_~b~0.base c_main_~a~0.base)))) is different from false [2022-01-31 01:03:18,079 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (<= (mod c_main_~i~0 4294967296) 2147483647)) (.cse2 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1))) (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (let ((.cse0 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (or (not .cse0) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or .cse0 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (< 2 c_~N~0) .cse2 (< c_main_~i~0 (+ c_~N~0 1)) (= c_main_~b~0.offset 0) (<= c_~N~0 2147483647) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse4 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (let ((.cse3 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (or .cse3 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= 1 (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset)))) (or (not .cse3) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse4 1 aux_mod_main_~i~0_26)) (< (+ .cse4 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (or .cse5 (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse6 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse6 1 aux_mod_main_~i~0_26)) (< (+ .cse6 2 aux_mod_main_~i~0_26) c_~N~0) (let ((.cse7 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or .cse7 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse7)))) (< 2147483647 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse9 (* 4294967296 aux_div_main_~i~0_26))) (or (let ((.cse8 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse8)) (or .cse8 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse9 1 aux_mod_main_~i~0_26)) (< (+ .cse9 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))))) (or (not .cse5) (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse10 (* 4294967296 aux_div_main_~i~0_26))) (or (<= c_~N~0 (+ .cse10 1 aux_mod_main_~i~0_26)) (let ((.cse11 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or .cse11 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse11)))) (< (+ .cse10 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse12 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse12 1 aux_mod_main_~i~0_26)) (< (+ .cse12 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26) (let ((.cse13 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse13)) (or .cse13 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)))))))))) (= c_main_~i~0 4) (or .cse2 (= (* (mod (+ c_main_~i~0 4294967294) 4294967296) 8) 0) (= 0 (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8))))) is different from false [2022-01-31 01:03:22,162 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1))) (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse0 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse0 1 aux_mod_main_~i~0_26)) (let ((.cse1 (<= (mod (+ c_main_~i~0 2) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse1)) (or .cse1 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (< (+ .cse0 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (< 2 c_~N~0) .cse2 (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse3 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse3 1 aux_mod_main_~i~0_26)) (let ((.cse4 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse4)) (or .cse4 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (< (+ .cse3 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (< c_main_~i~0 c_~N~0) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse5 (* 4294967296 aux_div_main_~i~0_26))) (or (<= c_~N~0 (+ .cse5 1 aux_mod_main_~i~0_26)) (let ((.cse6 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (not .cse6) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or .cse6 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (< (+ .cse5 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse7 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (<= c_~N~0 (+ .cse7 1 aux_mod_main_~i~0_26)) (< (+ .cse7 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (= c_main_~b~0.offset 0) (or .cse2 (= (* (mod c_main_~i~0 4294967296) 8) 0) (= 0 (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8))) (<= c_~N~0 2147483647) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse8 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse8 1 aux_mod_main_~i~0_26)) (< (+ .cse8 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse10 (* 4294967296 aux_div_main_~i~0_26))) (or (let ((.cse9 (<= (mod (+ c_main_~i~0 2) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) .cse9) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse9)))) (<= c_~N~0 (+ .cse10 1 aux_mod_main_~i~0_26)) (< (+ .cse10 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))))) is different from false [2022-01-31 01:03:24,194 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (<= (mod c_main_~i~0 4294967296) 2147483647)) (.cse2 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1))) (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (let ((.cse0 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (or (not .cse0) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or .cse0 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (< 2 c_~N~0) .cse2 (< c_main_~i~0 (+ c_~N~0 1)) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse3 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (<= c_~N~0 (+ .cse3 1 aux_mod_main_~i~0_26)) (< (+ .cse3 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (= c_main_~b~0.offset 0) (<= c_~N~0 2147483647) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse4 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse4 1 aux_mod_main_~i~0_26)) (< (+ .cse4 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse6 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (let ((.cse5 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (or .cse5 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= 1 (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset)))) (or (not .cse5) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse6 1 aux_mod_main_~i~0_26)) (< (+ .cse6 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (or .cse7 (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse8 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse8 1 aux_mod_main_~i~0_26)) (< (+ .cse8 2 aux_mod_main_~i~0_26) c_~N~0) (let ((.cse9 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or .cse9 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse9)))) (< 2147483647 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse11 (* 4294967296 aux_div_main_~i~0_26))) (or (let ((.cse10 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse10)) (or .cse10 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse11 1 aux_mod_main_~i~0_26)) (< (+ .cse11 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))))) (or (not .cse7) (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse12 (* 4294967296 aux_div_main_~i~0_26))) (or (<= c_~N~0 (+ .cse12 1 aux_mod_main_~i~0_26)) (let ((.cse13 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or .cse13 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse13)))) (< (+ .cse12 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse14 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse14 1 aux_mod_main_~i~0_26)) (< (+ .cse14 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26) (let ((.cse15 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse15)) (or .cse15 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_969 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_969) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)))))))))) (or .cse2 (= (* (mod (+ c_main_~i~0 4294967294) 4294967296) 8) 0) (= 0 (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8))))) is different from false [2022-01-31 01:03:26,275 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse3 (= (* (mod c_main_~i~0 4294967296) 8) 0))) (and (< 2 c_~N~0) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse0 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse0 1 aux_mod_main_~i~0_26)) (let ((.cse1 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not .cse1)) (or .cse1 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (< (+ .cse0 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (or .cse2 .cse3) (< c_main_~i~0 c_~N~0) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse4 (* 4294967296 aux_div_main_~i~0_26))) (or (<= c_~N~0 (+ .cse4 1 aux_mod_main_~i~0_26)) (let ((.cse5 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (not .cse5) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or .cse5 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (< (+ .cse4 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse6 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (<= c_~N~0 (+ .cse6 1 aux_mod_main_~i~0_26)) (< (+ .cse6 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (= c_main_~b~0.offset 0) (or .cse2 .cse3 (= 0 (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8))) (<= c_~N~0 2147483647) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse7 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse7 1 aux_mod_main_~i~0_26)) (< (+ .cse7 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))))) is different from false [2022-01-31 01:03:30,397 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse3 (= 0 (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8)))) (and (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (let ((.cse0 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (or (not .cse0) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))) (or .cse0 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (< 2 c_~N~0) (or .cse2 .cse3) (< c_main_~i~0 (+ c_~N~0 1)) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse4 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (<= c_~N~0 (+ .cse4 1 aux_mod_main_~i~0_26)) (< (+ .cse4 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (= c_main_~b~0.offset 0) (<= c_~N~0 2147483647) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse5 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse5 1 aux_mod_main_~i~0_26)) (< (+ .cse5 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (forall ((aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int)) (let ((.cse7 (* 4294967296 aux_div_main_~i~0_26))) (or (< aux_mod_main_~i~0_26 0) (let ((.cse6 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (or .cse6 (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= 1 (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) (- 34359738368) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset)))) (or (not .cse6) (forall ((v_ArrVal_972 Int) (v_ArrVal_971 Int) (v_ArrVal_974 Int)) (= (select (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_971) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1))))) (<= c_~N~0 (+ .cse7 1 aux_mod_main_~i~0_26)) (< (+ .cse7 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (or .cse2 (= (* (mod (+ c_main_~i~0 4294967294) 4294967296) 8) 0) .cse3))) is different from false [2022-01-31 01:03:31,914 WARN L838 $PredicateComparison]: unable to prove that (and (< 2 c_~N~0) (< c_main_~i~0 c_~N~0) (or (not (< (+ c_main_~i~0 1) c_~N~0)) (forall ((v_ArrVal_974 Int)) (= (select (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 8) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (< (+ c_main_~i~0 2) c_~N~0)) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse0 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (<= c_~N~0 (+ .cse0 1 aux_mod_main_~i~0_26)) (< (+ .cse0 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (= c_main_~b~0.offset 0) (or (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= (* (mod c_main_~i~0 4294967296) 8) 0) (= 0 (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8))) (<= c_~N~0 2147483647) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26))))) is different from false [2022-01-31 01:03:33,489 WARN L838 $PredicateComparison]: unable to prove that (and (< 2 c_~N~0) (or (forall ((v_ArrVal_974 Int)) (= (select (store (select |c_#memory_int| c_main_~b~0.base) (+ (* (mod c_main_~i~0 4294967296) 8) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1)) (not (< c_main_~i~0 c_~N~0)) (< (+ c_main_~i~0 1) c_~N~0)) (< c_main_~i~0 (+ c_~N~0 1)) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse0 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) (- 34359738368) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (<= c_~N~0 (+ .cse0 1 aux_mod_main_~i~0_26)) (< (+ .cse0 2 aux_mod_main_~i~0_26) c_~N~0) (<= aux_mod_main_~i~0_26 2147483647) (<= 4294967296 aux_mod_main_~i~0_26)))) (= c_main_~b~0.offset 0) (<= c_~N~0 2147483647) (forall ((v_ArrVal_972 Int) (aux_div_main_~i~0_26 Int) (aux_mod_main_~i~0_26 Int) (v_ArrVal_974 Int)) (let ((.cse1 (* 4294967296 aux_div_main_~i~0_26))) (or (= (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 (mod aux_mod_main_~i~0_26 4294967296)) c_main_~b~0.offset) v_ArrVal_972) (+ (* 8 (mod (+ 1 aux_mod_main_~i~0_26) 4294967296)) c_main_~b~0.offset) v_ArrVal_974) c_main_~b~0.offset) 1) (< aux_mod_main_~i~0_26 0) (<= c_~N~0 (+ .cse1 1 aux_mod_main_~i~0_26)) (< (+ .cse1 2 aux_mod_main_~i~0_26) c_~N~0) (< 2147483647 aux_mod_main_~i~0_26)))) (or (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= (* (mod (+ c_main_~i~0 4294967294) 4294967296) 8) 0) (= 0 (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8)))) is different from false [2022-01-31 01:03:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:03:42,086 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2022-01-31 01:03:42,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 01:03:42,087 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2022-01-31 01:03:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:03:42,088 INFO L225 Difference]: With dead ends: 185 [2022-01-31 01:03:42,088 INFO L226 Difference]: Without dead ends: 183 [2022-01-31 01:03:42,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 246.9s TimeCoverageRelationStatistics Valid=560, Invalid=2210, Unknown=42, NotChecked=1610, Total=4422 [2022-01-31 01:03:42,089 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:03:42,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 324 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 220 Invalid, 0 Unknown, 309 Unchecked, 0.3s Time] [2022-01-31 01:03:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-01-31 01:03:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2022-01-31 01:03:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 147 states have (on average 1.0952380952380953) internal successors, (161), 150 states have internal predecessors, (161), 21 states have call successors, (21), 12 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 01:03:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 200 transitions. [2022-01-31 01:03:42,129 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 200 transitions. Word has length 46 [2022-01-31 01:03:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:03:42,129 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 200 transitions. [2022-01-31 01:03:42,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 01:03:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 200 transitions. [2022-01-31 01:03:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 01:03:42,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:03:42,130 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2022-01-31 01:03:42,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-31 01:03:42,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:03:42,339 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:03:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:03:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash 942350571, now seen corresponding path program 8 times [2022-01-31 01:03:42,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:03:42,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029642161] [2022-01-31 01:03:42,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:03:42,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:03:42,351 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:03:42,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866802797] [2022-01-31 01:03:42,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:03:42,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:03:42,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:03:42,353 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:03:42,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-31 01:03:42,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:03:42,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:03:42,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-31 01:03:42,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:03:42,794 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-31 01:03:42,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-01-31 01:03:42,820 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-01-31 01:03:42,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2022-01-31 01:03:42,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 01:03:42,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 15 [2022-01-31 01:03:42,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 01:03:42,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-01-31 01:03:42,867 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 5 treesize of output 3 [2022-01-31 01:03:42,882 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 7 treesize of output 3 [2022-01-31 01:03:42,905 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 10 treesize of output 8 [2022-01-31 01:03:42,963 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:03:42,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 109 [2022-01-31 01:03:42,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:03:42,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:42,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:42,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:42,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:42,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:42,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:42,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 133 [2022-01-31 01:03:42,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:42,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:42,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:42,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 93 [2022-01-31 01:03:43,065 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:03:43,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 71 [2022-01-31 01:03:43,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 80 [2022-01-31 01:03:43,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2022-01-31 01:03:43,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,161 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 01:03:43,161 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 43 treesize of output 44 [2022-01-31 01:03:43,266 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:03:43,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 161 [2022-01-31 01:03:43,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:03:43,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 158 [2022-01-31 01:03:43,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 86 [2022-01-31 01:03:43,410 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:03:43,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 147 [2022-01-31 01:03:43,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:03:43,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 174 [2022-01-31 01:03:43,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 72 [2022-01-31 01:03:43,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:03:43,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:43,599 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-31 01:03:43,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 71 [2022-01-31 01:03:44,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:44,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:03:44,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:44,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:44,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:44,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:44,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:03:44,101 INFO L353 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2022-01-31 01:03:44,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 113 treesize of output 50 [2022-01-31 01:03:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:03:44,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:04:17,933 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ c_main_~i~0 2) 4294967296) 2147483647)) (.cse20 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647)) (.cse21 (<= (mod c_main_~i~0 4294967296) 2147483647))) (let ((.cse0 (<= (mod (+ c_main_~i~0 4294967295) 4294967296) 2147483647)) (.cse30 (not .cse21)) (.cse19 (not .cse20)) (.cse18 (not .cse1))) (and (or (not .cse0) (and (or (and (or .cse1 (forall ((v_ArrVal_1031 Int) (v_ArrVal_1034 Int) (v_ArrVal_1039 Int)) (= (let ((.cse3 (+ 16 c_main_~b~0.offset))) (select (store (let ((.cse8 (store (store (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base))) (store .cse9 (+ c_main_~a~0.offset (* (mod c_main_~i~0 4294967296) 8)) (+ 6 (select .cse9 (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8)))))) (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 1) 4294967296) 8)) v_ArrVal_1031) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) c_main_~a~0.offset (- 34359738368)) v_ArrVal_1034))) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base .cse8))) (let ((.cse7 (select .cse6 c_main_~b~0.base))) (let ((.cse4 (select .cse8 c_main_~a~0.offset)) (.cse5 (select .cse7 c_main_~b~0.offset))) (let ((.cse2 (store .cse7 (+ 8 c_main_~b~0.offset) (+ .cse4 .cse5)))) (store .cse2 .cse3 (+ .cse4 .cse5 (select (select (store .cse6 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))))) (+ c_main_~b~0.offset 24) v_ArrVal_1039) .cse3)) 19))) (or (forall ((v_ArrVal_1031 Int) (v_ArrVal_1034 Int) (v_ArrVal_1039 Int)) (= 19 (let ((.cse11 (+ 16 c_main_~b~0.offset))) (select (store (let ((.cse16 (store (store (let ((.cse17 (select |c_#memory_int| c_main_~a~0.base))) (store .cse17 (+ c_main_~a~0.offset (* (mod c_main_~i~0 4294967296) 8)) (+ 6 (select .cse17 (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8)))))) (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 1) 4294967296) 8)) v_ArrVal_1031) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) c_main_~a~0.offset) v_ArrVal_1034))) (let ((.cse13 (store |c_#memory_int| c_main_~a~0.base .cse16))) (let ((.cse15 (select .cse13 c_main_~b~0.base))) (let ((.cse12 (select .cse15 c_main_~b~0.offset)) (.cse14 (select .cse16 c_main_~a~0.offset))) (let ((.cse10 (store .cse15 (+ 8 c_main_~b~0.offset) (+ .cse12 .cse14)))) (store .cse10 .cse11 (+ .cse12 (select (select (store .cse13 c_main_~b~0.base .cse10) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse14))))))) (+ c_main_~b~0.offset 24) v_ArrVal_1039) .cse11)))) .cse18)) .cse19) (or .cse20 (and (or .cse21 (forall ((v_ArrVal_1031 Int) (v_ArrVal_1034 Int) (v_ArrVal_1039 Int)) (= 19 (let ((.cse23 (+ 16 c_main_~b~0.offset))) (select (store (let ((.cse28 (store (store (let ((.cse29 (select |c_#memory_int| c_main_~a~0.base))) (store .cse29 (+ c_main_~a~0.offset (* (mod c_main_~i~0 4294967296) 8) (- 34359738368)) (+ 6 (select .cse29 (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8)))))) (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368)) v_ArrVal_1031) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) c_main_~a~0.offset (- 34359738368)) v_ArrVal_1034))) (let ((.cse26 (store |c_#memory_int| c_main_~a~0.base .cse28))) (let ((.cse27 (select .cse26 c_main_~b~0.base))) (let ((.cse24 (select .cse27 c_main_~b~0.offset)) (.cse25 (select .cse28 c_main_~a~0.offset))) (let ((.cse22 (store .cse27 (+ 8 c_main_~b~0.offset) (+ .cse24 .cse25)))) (store .cse22 .cse23 (+ .cse24 .cse25 (select (select (store .cse26 c_main_~b~0.base .cse22) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))))) (+ c_main_~b~0.offset 24) v_ArrVal_1039) .cse23))))) (or .cse30 (forall ((v_ArrVal_1031 Int) (v_ArrVal_1034 Int) (v_ArrVal_1039 Int)) (= 19 (let ((.cse32 (+ 16 c_main_~b~0.offset))) (select (store (let ((.cse37 (store (store (let ((.cse38 (select |c_#memory_int| c_main_~a~0.base))) (store .cse38 (+ c_main_~a~0.offset (* (mod c_main_~i~0 4294967296) 8)) (+ 6 (select .cse38 (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8)))))) (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368)) v_ArrVal_1031) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) c_main_~a~0.offset (- 34359738368)) v_ArrVal_1034))) (let ((.cse34 (store |c_#memory_int| c_main_~a~0.base .cse37))) (let ((.cse36 (select .cse34 c_main_~b~0.base))) (let ((.cse33 (select .cse36 c_main_~b~0.offset)) (.cse35 (select .cse37 c_main_~a~0.offset))) (let ((.cse31 (store .cse36 (+ 8 c_main_~b~0.offset) (+ .cse33 .cse35)))) (store .cse31 .cse32 (+ .cse33 (select (select (store .cse34 c_main_~b~0.base .cse31) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse35))))))) (+ c_main_~b~0.offset 24) v_ArrVal_1039) .cse32))))))))) (or .cse0 (and (or (and (or .cse21 (forall ((v_ArrVal_1031 Int) (v_ArrVal_1034 Int) (v_ArrVal_1039 Int)) (= 19 (let ((.cse40 (+ 16 c_main_~b~0.offset))) (select (store (let ((.cse45 (store (store (let ((.cse46 (select |c_#memory_int| c_main_~a~0.base))) (store .cse46 (+ c_main_~a~0.offset (* (mod c_main_~i~0 4294967296) 8) (- 34359738368)) (+ (select .cse46 (+ c_main_~a~0.offset (- 34359738368) (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8))) 6))) (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 1) 4294967296) 8)) v_ArrVal_1031) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) c_main_~a~0.offset) v_ArrVal_1034))) (let ((.cse42 (store |c_#memory_int| c_main_~a~0.base .cse45))) (let ((.cse44 (select .cse42 c_main_~b~0.base))) (let ((.cse41 (select .cse44 c_main_~b~0.offset)) (.cse43 (select .cse45 c_main_~a~0.offset))) (let ((.cse39 (store .cse44 (+ 8 c_main_~b~0.offset) (+ .cse41 .cse43)))) (store .cse39 .cse40 (+ .cse41 (select (select (store .cse42 c_main_~b~0.base .cse39) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse43))))))) (+ c_main_~b~0.offset 24) v_ArrVal_1039) .cse40))))) (or .cse30 (forall ((v_ArrVal_1031 Int) (v_ArrVal_1034 Int) (v_ArrVal_1039 Int)) (= 19 (let ((.cse48 (+ 16 c_main_~b~0.offset))) (select (store (let ((.cse53 (store (store (let ((.cse54 (select |c_#memory_int| c_main_~a~0.base))) (store .cse54 (+ c_main_~a~0.offset (* (mod c_main_~i~0 4294967296) 8)) (+ (select .cse54 (+ c_main_~a~0.offset (- 34359738368) (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8))) 6))) (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 1) 4294967296) 8)) v_ArrVal_1031) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) c_main_~a~0.offset) v_ArrVal_1034))) (let ((.cse50 (store |c_#memory_int| c_main_~a~0.base .cse53))) (let ((.cse52 (select .cse50 c_main_~b~0.base))) (let ((.cse49 (select .cse53 c_main_~a~0.offset)) (.cse51 (select .cse52 c_main_~b~0.offset))) (let ((.cse47 (store .cse52 (+ 8 c_main_~b~0.offset) (+ .cse49 .cse51)))) (store .cse47 .cse48 (+ .cse49 (select (select (store .cse50 c_main_~b~0.base .cse47) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse51))))))) (+ c_main_~b~0.offset 24) v_ArrVal_1039) .cse48)))))) .cse19) (or .cse20 (and (forall ((v_ArrVal_1031 Int) (v_ArrVal_1034 Int) (v_ArrVal_1039 Int)) (= 19 (let ((.cse56 (+ 16 c_main_~b~0.offset))) (select (store (let ((.cse61 (store (store (let ((.cse62 (select |c_#memory_int| c_main_~a~0.base))) (store .cse62 (+ c_main_~a~0.offset (* (mod c_main_~i~0 4294967296) 8) (- 34359738368)) (+ (select .cse62 (+ c_main_~a~0.offset (- 34359738368) (* (mod (+ c_main_~i~0 4294967295) 4294967296) 8))) 6))) (+ c_main_~a~0.offset (* (mod (+ c_main_~i~0 1) 4294967296) 8) (- 34359738368)) v_ArrVal_1031) (+ (* (mod (+ c_main_~i~0 2) 4294967296) 8) c_main_~a~0.offset (- 34359738368)) v_ArrVal_1034))) (let ((.cse59 (store |c_#memory_int| c_main_~a~0.base .cse61))) (let ((.cse60 (select .cse59 c_main_~b~0.base))) (let ((.cse57 (select .cse61 c_main_~a~0.offset)) (.cse58 (select .cse60 c_main_~b~0.offset))) (let ((.cse55 (store .cse60 (+ 8 c_main_~b~0.offset) (+ .cse57 .cse58)))) (store .cse55 .cse56 (+ .cse57 .cse58 (select (select (store .cse59 c_main_~b~0.base .cse55) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))))) (+ c_main_~b~0.offset 24) v_ArrVal_1039) .cse56)))) .cse18))))))) is different from false [2022-01-31 01:04:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2022-01-31 01:04:18,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:04:18,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029642161] [2022-01-31 01:04:18,975 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:04:18,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866802797] [2022-01-31 01:04:18,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866802797] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:04:18,975 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:04:18,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 34 [2022-01-31 01:04:18,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425579682] [2022-01-31 01:04:18,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:04:18,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 01:04:18,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:04:18,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 01:04:18,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=909, Unknown=8, NotChecked=62, Total=1122 [2022-01-31 01:04:18,976 INFO L87 Difference]: Start difference. First operand 178 states and 200 transitions. Second operand has 34 states, 32 states have (on average 2.0) internal successors, (64), 33 states have internal predecessors, (64), 7 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 01:04:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:04:30,255 INFO L93 Difference]: Finished difference Result 214 states and 240 transitions. [2022-01-31 01:04:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 01:04:30,255 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.0) internal successors, (64), 33 states have internal predecessors, (64), 7 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-01-31 01:04:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:04:30,257 INFO L225 Difference]: With dead ends: 214 [2022-01-31 01:04:30,257 INFO L226 Difference]: Without dead ends: 212 [2022-01-31 01:04:30,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=248, Invalid=1637, Unknown=11, NotChecked=84, Total=1980 [2022-01-31 01:04:30,258 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:04:30,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 436 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 151 Invalid, 0 Unknown, 251 Unchecked, 0.3s Time] [2022-01-31 01:04:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-01-31 01:04:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2022-01-31 01:04:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 166 states have (on average 1.0843373493975903) internal successors, (180), 171 states have internal predecessors, (180), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (23), 18 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-31 01:04:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 229 transitions. [2022-01-31 01:04:30,308 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 229 transitions. Word has length 50 [2022-01-31 01:04:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:04:30,308 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 229 transitions. [2022-01-31 01:04:30,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.0) internal successors, (64), 33 states have internal predecessors, (64), 7 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 01:04:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 229 transitions. [2022-01-31 01:04:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 01:04:30,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:04:30,310 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:04:30,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-31 01:04:30,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-01-31 01:04:30,515 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:04:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:04:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1682237837, now seen corresponding path program 9 times [2022-01-31 01:04:30,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:04:30,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2872181] [2022-01-31 01:04:30,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:04:30,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:04:30,529 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:04:30,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843609816] [2022-01-31 01:04:30,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:04:30,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:04:30,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:04:30,535 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:04:30,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-31 01:04:32,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-31 01:04:32,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:04:32,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-31 01:04:32,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:04:32,268 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 10 treesize of output 8 [2022-01-31 01:04:32,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,275 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-01-31 01:04:32,282 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 0 case distinctions, treesize of input 20 treesize of output 20 [2022-01-31 01:04:32,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 01:04:32,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-31 01:04:32,362 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:04:32,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2022-01-31 01:04:32,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 01:04:32,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2022-01-31 01:04:32,452 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:04:32,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2022-01-31 01:04:32,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 01:04:32,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2022-01-31 01:04:32,518 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:04:32,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2022-01-31 01:04:32,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 01:04:32,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2022-01-31 01:04:32,588 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:04:32,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2022-01-31 01:04:32,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 01:04:32,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2022-01-31 01:04:32,668 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:04:32,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2022-01-31 01:04:32,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2022-01-31 01:04:32,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2022-01-31 01:04:32,844 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:04:32,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 127 [2022-01-31 01:04:32,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:04:32,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 155 [2022-01-31 01:04:32,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:32,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 29 [2022-01-31 01:04:33,049 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-31 01:04:33,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 91 [2022-01-31 01:04:33,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 118 [2022-01-31 01:04:33,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 28 [2022-01-31 01:04:33,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,195 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 01:04:33,195 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 43 treesize of output 44 [2022-01-31 01:04:33,278 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-31 01:04:33,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 71 [2022-01-31 01:04:33,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,316 INFO L353 Elim1Store]: treesize reduction 104, result has 28.3 percent of original size [2022-01-31 01:04:33,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 94 [2022-01-31 01:04:33,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 01:04:33,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2022-01-31 01:04:33,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 37 [2022-01-31 01:04:33,618 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 0 case distinctions, treesize of input 104 treesize of output 96 [2022-01-31 01:04:33,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,648 INFO L353 Elim1Store]: treesize reduction 42, result has 40.8 percent of original size [2022-01-31 01:04:33,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 119 [2022-01-31 01:04:33,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:04:33,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 62 [2022-01-31 01:04:33,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:33,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 49 [2022-01-31 01:04:34,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:34,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:04:34,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:34,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:04:34,327 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-31 01:04:34,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 39 [2022-01-31 01:04:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:04:34,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:04:52,131 WARN L228 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:06:13,756 WARN L228 SmtUtils]: Spent 44.90s on a formula simplification. DAG size of input: 127 DAG size of output: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:07:27,671 WARN L228 SmtUtils]: Spent 57.08s on a formula simplification. DAG size of input: 192 DAG size of output: 171 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:07:36,156 WARN L228 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:08:18,476 WARN L228 SmtUtils]: Spent 18.92s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:08:38,582 WARN L228 SmtUtils]: Spent 13.22s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:09:18,335 WARN L228 SmtUtils]: Spent 11.95s on a formula simplification. DAG size of input: 170 DAG size of output: 149 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:10:02,896 WARN L228 SmtUtils]: Spent 25.98s on a formula simplification. DAG size of input: 200 DAG size of output: 180 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:10:25,213 WARN L228 SmtUtils]: Spent 10.64s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)