./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503513a726b63dcf7252b591818901fbaab844b1443a8550e123aa98a06238f6 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 08:53:39,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 08:53:39,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 08:53:39,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 08:53:39,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 08:53:39,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 08:53:39,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 08:53:39,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 08:53:39,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 08:53:39,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 08:53:39,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 08:53:39,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 08:53:39,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 08:53:39,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 08:53:39,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 08:53:39,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 08:53:39,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 08:53:39,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 08:53:39,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 08:53:39,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 08:53:39,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 08:53:39,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 08:53:39,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 08:53:39,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 08:53:39,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 08:53:39,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 08:53:39,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 08:53:39,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 08:53:39,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 08:53:39,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 08:53:39,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 08:53:39,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 08:53:39,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 08:53:39,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 08:53:39,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 08:53:39,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 08:53:39,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 08:53:39,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 08:53:39,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 08:53:39,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 08:53:39,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 08:53:39,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 08:53:39,617 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 08:53:39,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 08:53:39,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 08:53:39,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 08:53:39,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 08:53:39,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 08:53:39,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 08:53:39,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 08:53:39,619 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 08:53:39,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 08:53:39,620 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 08:53:39,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 08:53:39,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 08:53:39,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 08:53:39,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 08:53:39,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 08:53:39,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 08:53:39,621 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 08:53:39,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 08:53:39,621 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 08:53:39,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 08:53:39,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 08:53:39,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 08:53:39,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 08:53:39,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:53:39,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 08:53:39,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 08:53:39,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 08:53:39,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 08:53:39,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 08:53:39,623 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 08:53:39,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 08:53:39,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 08:53:39,624 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 08:53:39,624 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 503513a726b63dcf7252b591818901fbaab844b1443a8550e123aa98a06238f6 [2021-12-15 08:53:39,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 08:53:39,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 08:53:39,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 08:53:39,838 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 08:53:39,838 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 08:53:39,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina5.c [2021-12-15 08:53:39,882 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38a77d10/83f2efeb4ab14737bfc9af6837dcadfa/FLAG4b2eae523 [2021-12-15 08:53:40,256 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 08:53:40,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina5.c [2021-12-15 08:53:40,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38a77d10/83f2efeb4ab14737bfc9af6837dcadfa/FLAG4b2eae523 [2021-12-15 08:53:40,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38a77d10/83f2efeb4ab14737bfc9af6837dcadfa [2021-12-15 08:53:40,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 08:53:40,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 08:53:40,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 08:53:40,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 08:53:40,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 08:53:40,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f7cf75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40, skipping insertion in model container [2021-12-15 08:53:40,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 08:53:40,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:53:40,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina5.c[588,601] [2021-12-15 08:53:40,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:53:40,824 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 08:53:40,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina5.c[588,601] [2021-12-15 08:53:40,854 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:53:40,864 INFO L208 MainTranslator]: Completed translation [2021-12-15 08:53:40,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40 WrapperNode [2021-12-15 08:53:40,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 08:53:40,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 08:53:40,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 08:53:40,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 08:53:40,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,903 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2021-12-15 08:53:40,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 08:53:40,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 08:53:40,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 08:53:40,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 08:53:40,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 08:53:40,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 08:53:40,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 08:53:40,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 08:53:40,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (1/1) ... [2021-12-15 08:53:40,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:53:40,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:40,965 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) [2021-12-15 08:53:40,985 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 [2021-12-15 08:53:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 08:53:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 08:53:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 08:53:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 08:53:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 08:53:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 08:53:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 08:53:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 08:53:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 08:53:41,095 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 08:53:41,097 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 08:53:41,277 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 08:53:41,281 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 08:53:41,281 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-15 08:53:41,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:53:41 BoogieIcfgContainer [2021-12-15 08:53:41,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 08:53:41,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 08:53:41,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 08:53:41,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 08:53:41,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:53:40" (1/3) ... [2021-12-15 08:53:41,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fa30a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:53:41, skipping insertion in model container [2021-12-15 08:53:41,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:40" (2/3) ... [2021-12-15 08:53:41,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fa30a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:53:41, skipping insertion in model container [2021-12-15 08:53:41,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:53:41" (3/3) ... [2021-12-15 08:53:41,291 INFO L111 eAbstractionObserver]: Analyzing ICFG sina5.c [2021-12-15 08:53:41,294 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 08:53:41,295 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 08:53:41,336 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 08:53:41,344 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 [2021-12-15 08:53:41,344 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 08:53:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:41,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 08:53:41,361 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:41,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:41,362 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:41,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash -635308358, now seen corresponding path program 1 times [2021-12-15 08:53:41,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:41,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561616489] [2021-12-15 08:53:41,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:41,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:41,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:41,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561616489] [2021-12-15 08:53:41,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561616489] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:53:41,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:53:41,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 08:53:41,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048784228] [2021-12-15 08:53:41,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:53:41,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 08:53:41,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:41,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 08:53:41,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 08:53:41,527 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:41,541 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2021-12-15 08:53:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 08:53:41,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 08:53:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:41,548 INFO L225 Difference]: With dead ends: 56 [2021-12-15 08:53:41,549 INFO L226 Difference]: Without dead ends: 26 [2021-12-15 08:53:41,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 08:53:41,554 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:41,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:53:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-15 08:53:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-15 08:53:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-12-15 08:53:41,579 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2021-12-15 08:53:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:41,579 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-12-15 08:53:41,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2021-12-15 08:53:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 08:53:41,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:41,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:41,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 08:53:41,582 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1344199344, now seen corresponding path program 1 times [2021-12-15 08:53:41,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:41,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574624636] [2021-12-15 08:53:41,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:41,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:41,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:41,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574624636] [2021-12-15 08:53:41,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574624636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:53:41,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:53:41,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:53:41,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119197441] [2021-12-15 08:53:41,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:53:41,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:53:41,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:53:41,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:53:41,684 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:41,751 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2021-12-15 08:53:41,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:53:41,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 08:53:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:41,754 INFO L225 Difference]: With dead ends: 61 [2021-12-15 08:53:41,754 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 08:53:41,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:53:41,758 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:41,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 18 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:53:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 08:53:41,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2021-12-15 08:53:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-12-15 08:53:41,768 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2021-12-15 08:53:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:41,769 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-12-15 08:53:41,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-12-15 08:53:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 08:53:41,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:41,771 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, 1, 1] [2021-12-15 08:53:41,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 08:53:41,772 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash -933126362, now seen corresponding path program 1 times [2021-12-15 08:53:41,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:41,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766680024] [2021-12-15 08:53:41,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:41,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:42,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766680024] [2021-12-15 08:53:42,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766680024] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:42,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665085276] [2021-12-15 08:53:42,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:42,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:42,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:42,663 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) [2021-12-15 08:53:42,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 08:53:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:42,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-15 08:53:42,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:42,819 INFO L388 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 [2021-12-15 08:53:42,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 08:53:42,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 08:53:43,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:43,120 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-15 08:53:43,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-12-15 08:53:43,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:43,301 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 08:53:43,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2021-12-15 08:53:43,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:43,467 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 08:53:43,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-12-15 08:53:43,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:43,663 INFO L354 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2021-12-15 08:53:43,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 39 [2021-12-15 08:53:44,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:44,042 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:44,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2021-12-15 08:53:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:44,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:44,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:53:44,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:53:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:44,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665085276] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:44,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:44,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 44 [2021-12-15 08:53:44,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583301438] [2021-12-15 08:53:44,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:44,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-15 08:53:44,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:44,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-15 08:53:44,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1668, Unknown=0, NotChecked=0, Total=1892 [2021-12-15 08:53:44,734 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:45,595 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2021-12-15 08:53:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 08:53:45,596 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 08:53:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:45,597 INFO L225 Difference]: With dead ends: 64 [2021-12-15 08:53:45,597 INFO L226 Difference]: Without dead ends: 62 [2021-12-15 08:53:45,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=394, Invalid=2576, Unknown=0, NotChecked=0, Total=2970 [2021-12-15 08:53:45,598 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 52 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:45,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 154 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 448 Invalid, 0 Unknown, 26 Unchecked, 0.3s Time] [2021-12-15 08:53:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-15 08:53:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2021-12-15 08:53:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2021-12-15 08:53:45,604 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 28 [2021-12-15 08:53:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:45,604 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2021-12-15 08:53:45,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2021-12-15 08:53:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 08:53:45,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:45,605 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, 1, 1] [2021-12-15 08:53:45,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:45,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:45,821 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:45,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:45,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1642466588, now seen corresponding path program 2 times [2021-12-15 08:53:45,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:45,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881162084] [2021-12-15 08:53:45,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:45,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 08:53:45,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:45,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881162084] [2021-12-15 08:53:45,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881162084] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:45,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388114679] [2021-12-15 08:53:45,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:53:45,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:45,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:45,895 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) [2021-12-15 08:53:45,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 08:53:45,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:53:45,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:45,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:53:45,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 08:53:46,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 08:53:46,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388114679] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:46,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:46,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 08:53:46,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178511039] [2021-12-15 08:53:46,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:46,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 08:53:46,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:46,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 08:53:46,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 08:53:46,075 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:46,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:46,201 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2021-12-15 08:53:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 08:53:46,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-15 08:53:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:46,202 INFO L225 Difference]: With dead ends: 134 [2021-12-15 08:53:46,202 INFO L226 Difference]: Without dead ends: 78 [2021-12-15 08:53:46,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-15 08:53:46,203 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 59 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:46,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 59 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:53:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-15 08:53:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2021-12-15 08:53:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2021-12-15 08:53:46,209 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 30 [2021-12-15 08:53:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:46,209 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2021-12-15 08:53:46,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2021-12-15 08:53:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 08:53:46,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:46,210 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, 1, 1] [2021-12-15 08:53:46,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:46,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-15 08:53:46,429 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash -396360796, now seen corresponding path program 3 times [2021-12-15 08:53:46,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:46,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536071919] [2021-12-15 08:53:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:46,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 08:53:46,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:46,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536071919] [2021-12-15 08:53:46,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536071919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:46,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750850206] [2021-12-15 08:53:46,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:53:46,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:46,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:46,476 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) [2021-12-15 08:53:46,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 08:53:46,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-15 08:53:46,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:46,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:53:46,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 08:53:46,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 08:53:46,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750850206] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:46,658 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:46,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 08:53:46,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113064235] [2021-12-15 08:53:46,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:46,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 08:53:46,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:46,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 08:53:46,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 08:53:46,659 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:46,773 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2021-12-15 08:53:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 08:53:46,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-15 08:53:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:46,774 INFO L225 Difference]: With dead ends: 74 [2021-12-15 08:53:46,774 INFO L226 Difference]: Without dead ends: 57 [2021-12-15 08:53:46,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-15 08:53:46,775 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 100 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:46,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 44 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:53:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-15 08:53:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2021-12-15 08:53:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2021-12-15 08:53:46,779 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2021-12-15 08:53:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:46,779 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2021-12-15 08:53:46,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2021-12-15 08:53:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 08:53:46,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:46,780 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:46,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:46,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:46,995 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:46,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash 389318684, now seen corresponding path program 4 times [2021-12-15 08:53:46,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:46,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654227128] [2021-12-15 08:53:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:46,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:48,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:48,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654227128] [2021-12-15 08:53:48,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654227128] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:48,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053602719] [2021-12-15 08:53:48,538 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 08:53:48,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:48,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:48,539 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) [2021-12-15 08:53:48,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 08:53:48,588 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 08:53:48,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:48,589 WARN L261 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-15 08:53:48,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:48,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 08:53:48,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:48,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-15 08:53:48,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:48,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 08:53:48,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:48,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:48,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2021-12-15 08:53:49,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,041 INFO L388 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 39 treesize of output 44 [2021-12-15 08:53:49,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2021-12-15 08:53:49,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:53:49,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-12-15 08:53:49,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2021-12-15 08:53:49,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:53:49,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:49,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-12-15 08:53:50,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2021-12-15 08:53:50,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:53:50,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2021-12-15 08:53:50,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:53:50,526 INFO L354 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2021-12-15 08:53:50,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 74 [2021-12-15 08:53:50,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:50,858 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 08:53:50,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 45 [2021-12-15 08:53:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:50,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:53,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_81| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_81| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_254 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1))))) is different from false [2021-12-15 08:54:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-15 08:54:13,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053602719] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:13,435 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:54:13,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 26] total 78 [2021-12-15 08:54:13,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94422253] [2021-12-15 08:54:13,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:13,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2021-12-15 08:54:13,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:13,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-12-15 08:54:13,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=5360, Unknown=30, NotChecked=150, Total=6006 [2021-12-15 08:54:13,438 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 78 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:16,486 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (+ (* 2 c_~N~0) 1)) (.cse0 (select .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (< 1 c_~N~0) (<= .cse0 .cse1) (= (select .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse4 0))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse3 1)) (= (select .cse4 8) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse5 1) (= .cse3 (+ .cse5 3)) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_main_~i~0#1_81| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_81| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_254 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= c_~N~0 2) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2021-12-15 08:54:18,582 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 2 c_~N~0) 1)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0))) (and (< 1 c_~N~0) (<= .cse0 .cse1) (<= .cse1 .cse0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_81| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_81| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_254 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1))))) (<= c_~N~0 2) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0)) (.cse4 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= (select .cse2 8) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse3 1) (= .cse4 (+ .cse3 3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse4 1)) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 8))) is different from false [2021-12-15 08:54:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:18,742 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2021-12-15 08:54:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-15 08:54:18,743 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-15 08:54:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:18,743 INFO L225 Difference]: With dead ends: 83 [2021-12-15 08:54:18,743 INFO L226 Difference]: Without dead ends: 81 [2021-12-15 08:54:18,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2590 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=573, Invalid=6379, Unknown=32, NotChecked=498, Total=7482 [2021-12-15 08:54:18,746 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 633 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:18,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 276 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 489 Invalid, 0 Unknown, 633 Unchecked, 0.3s Time] [2021-12-15 08:54:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-15 08:54:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2021-12-15 08:54:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2021-12-15 08:54:18,751 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 38 [2021-12-15 08:54:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:18,751 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2021-12-15 08:54:18,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2021-12-15 08:54:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 08:54:18,752 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:18,753 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-12-15 08:54:18,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:18,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:18,959 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1666934362, now seen corresponding path program 5 times [2021-12-15 08:54:18,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:18,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051569965] [2021-12-15 08:54:18,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:18,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:54:19,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:19,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051569965] [2021-12-15 08:54:19,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051569965] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:54:19,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164031904] [2021-12-15 08:54:19,022 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 08:54:19,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:19,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:19,023 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) [2021-12-15 08:54:19,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 08:54:19,120 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-15 08:54:19,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:54:19,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 08:54:19,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:54:19,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:54:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:54:19,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164031904] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:19,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:54:19,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-12-15 08:54:19,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304144665] [2021-12-15 08:54:19,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:19,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-15 08:54:19,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:19,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 08:54:19,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-15 08:54:19,321 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:19,705 INFO L93 Difference]: Finished difference Result 160 states and 182 transitions. [2021-12-15 08:54:19,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 08:54:19,706 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-15 08:54:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:19,706 INFO L225 Difference]: With dead ends: 160 [2021-12-15 08:54:19,706 INFO L226 Difference]: Without dead ends: 107 [2021-12-15 08:54:19,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2021-12-15 08:54:19,707 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 340 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:19,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 171 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 08:54:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-15 08:54:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 82. [2021-12-15 08:54:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2021-12-15 08:54:19,713 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 40 [2021-12-15 08:54:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:19,714 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2021-12-15 08:54:19,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2021-12-15 08:54:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 08:54:19,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:19,715 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:19,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:19,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:19,929 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:19,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:19,930 INFO L85 PathProgramCache]: Analyzing trace with hash -465930606, now seen corresponding path program 1 times [2021-12-15 08:54:19,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:19,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354227487] [2021-12-15 08:54:19,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:19,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:21,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:21,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354227487] [2021-12-15 08:54:21,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354227487] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:54:21,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656354075] [2021-12-15 08:54:21,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:21,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:21,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:21,627 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) [2021-12-15 08:54:21,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 08:54:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:21,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-15 08:54:21,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:21,697 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 08:54:21,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-12-15 08:54:21,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 08:54:21,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:54:21,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-15 08:54:21,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 08:54:21,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 08:54:22,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 08:54:22,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 08:54:22,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 08:54:22,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:54:22,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 08:54:22,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:54:22,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:54:22,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2021-12-15 08:54:22,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:54:22,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2021-12-15 08:54:22,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2021-12-15 08:54:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 08:54:22,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:54:24,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_398)))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_398 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse1 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse0 1) (- 2)) 0)) (= .cse1 (+ (* 2 (div (+ (* .cse0 (- 1)) 1) (- 2))) 1)))))))) is different from false [2021-12-15 08:54:24,745 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:54:24,745 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 226 [2021-12-15 08:54:26,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) is different from false [2021-12-15 08:54:27,081 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse0 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) is different from false [2021-12-15 08:54:29,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse1 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse0 1) (- 2)) 0)) (= .cse1 (+ (* 2 (div (+ (* .cse0 (- 1)) 1) (- 2))) 1)))))))) is different from false [2021-12-15 08:54:31,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) is different from false [2021-12-15 08:54:31,409 INFO L354 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2021-12-15 08:54:31,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 673 treesize of output 318 [2021-12-15 08:54:31,419 INFO L388 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 1157 treesize of output 1101 [2021-12-15 08:54:31,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:54:31,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:54:31,477 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:54:31,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 856 treesize of output 730 [2021-12-15 08:54:31,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:54:31,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:54:31,563 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:54:31,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 394 treesize of output 386 [2021-12-15 08:54:31,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:54:31,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:54:31,923 INFO L354 Elim1Store]: treesize reduction 29, result has 74.8 percent of original size [2021-12-15 08:54:31,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 case distinctions, treesize of input 355 treesize of output 401 [2021-12-15 08:54:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 11 not checked. [2021-12-15 08:54:34,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656354075] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:34,023 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:54:34,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 16, 18] total 62 [2021-12-15 08:54:34,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040235966] [2021-12-15 08:54:34,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:34,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-12-15 08:54:34,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:34,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-12-15 08:54:34,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=2828, Unknown=5, NotChecked=570, Total=3782 [2021-12-15 08:54:34,025 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 62 states, 62 states have (on average 1.7903225806451613) internal successors, (111), 62 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:39,601 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse0 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) (= (select .cse6 8) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse9 (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse7 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse10)))) (let ((.cse8 (select (store .cse9 .cse10 .cse7) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse7 (+ (* 2 (div (+ (* .cse8 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse8 1) (- 2)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (<= c_~N~0 2) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse6 0) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-15 08:54:41,827 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse0 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) (= (select .cse6 8) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) 0) 1) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (not (= (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* 8 |c_ULTIMATE.start_main_~i~0#1|)) 0)) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse9 (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse7 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse10)))) (let ((.cse8 (select (store .cse9 .cse10 .cse7) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse7 (+ (* 2 (div (+ (* .cse8 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse8 1) (- 2)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (<= c_~N~0 2) (= (select .cse6 0) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-15 08:54:44,280 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse0 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) (= (select .cse6 8) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse7 0) 1) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse10 (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse8 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse10 .cse11)))) (let ((.cse9 (select (store .cse10 .cse11 .cse8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse8 (+ (* 2 (div (+ (* .cse9 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse9 1) (- 2)) 0)))))))) (or (not (= 8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* 8 |c_ULTIMATE.start_main_~i~0#1|)))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))) 1)) (= (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (<= c_~N~0 2) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse6 0) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-15 08:54:46,349 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse0 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse9 (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse7 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse10)))) (let ((.cse8 (select (store .cse9 .cse10 .cse7) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse7 (+ (* 2 (div (+ (* .cse8 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse8 1) (- 2)) 0)))))))))) is different from false [2021-12-15 08:54:48,427 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse0 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) (= (select .cse6 8) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse7 0) 1) (or (<= (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* 8 |c_ULTIMATE.start_main_~i~0#1|) 1) (* 8 c_~N~0)) (= (select .cse7 8) 1)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse10 (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse8 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse10 .cse11)))) (let ((.cse9 (select (store .cse10 .cse11 .cse8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse8 (+ (* 2 (div (+ (* .cse9 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse9 1) (- 2)) 0)))))))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (<= c_~N~0 2) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse6 0) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-15 08:54:50,475 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse0 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse9 (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse7 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse10)))) (let ((.cse8 (select (store .cse9 .cse10 .cse7) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse7 (+ (* 2 (div (+ (* .cse8 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse8 1) (- 2)) 0)))))))))) is different from false [2021-12-15 08:54:52,558 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 8) 1) (= (select .cse1 8) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 0) 1) (<= c_~N~0 2) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse1 0) 1) (<= 2 c_~N~0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse2 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse5)))) (let ((.cse3 (select (store .cse4 .cse5 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse2 (+ (* 2 (div (+ (* .cse3 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse3 1) (- 2)) 0)))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false