./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ssina.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/ssina.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 4c9ca6c94ff0fae82185b19014fc033eef7a37c04f3b092e10c4eebb38e41241 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 02:28:43,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 02:28:43,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 02:28:43,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 02:28:43,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 02:28:43,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 02:28:43,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 02:28:43,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 02:28:43,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 02:28:43,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 02:28:43,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 02:28:43,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 02:28:43,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 02:28:43,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 02:28:43,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 02:28:43,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 02:28:43,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 02:28:43,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 02:28:43,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 02:28:43,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 02:28:43,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 02:28:43,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 02:28:43,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 02:28:43,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 02:28:43,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 02:28:43,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 02:28:43,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 02:28:43,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 02:28:43,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 02:28:43,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 02:28:43,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 02:28:43,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 02:28:43,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 02:28:43,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 02:28:43,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 02:28:43,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 02:28:43,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 02:28:43,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 02:28:43,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 02:28:43,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 02:28:43,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 02:28:43,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 02:28:43,176 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 02:28:43,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 02:28:43,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 02:28:43,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 02:28:43,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 02:28:43,178 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 02:28:43,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 02:28:43,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 02:28:43,179 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 02:28:43,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 02:28:43,180 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 02:28:43,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 02:28:43,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 02:28:43,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 02:28:43,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 02:28:43,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 02:28:43,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 02:28:43,181 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 02:28:43,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 02:28:43,181 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 02:28:43,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 02:28:43,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 02:28:43,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 02:28:43,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 02:28:43,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:28:43,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 02:28:43,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 02:28:43,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 02:28:43,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 02:28:43,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 02:28:43,183 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 02:28:43,183 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 02:28:43,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 02:28:43,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 02:28:43,183 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 -> 4c9ca6c94ff0fae82185b19014fc033eef7a37c04f3b092e10c4eebb38e41241 [2021-12-17 02:28:43,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:28:43,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:28:43,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:28:43,369 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:28:43,370 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:28:43,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ssina.c [2021-12-17 02:28:43,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0131b446a/1b6d29b1db574239bad98a56984b01ab/FLAGde6d33470 [2021-12-17 02:28:43,759 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:28:43,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ssina.c [2021-12-17 02:28:43,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0131b446a/1b6d29b1db574239bad98a56984b01ab/FLAGde6d33470 [2021-12-17 02:28:44,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0131b446a/1b6d29b1db574239bad98a56984b01ab [2021-12-17 02:28:44,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:28:44,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:28:44,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:28:44,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:28:44,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:28:44,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339e9929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44, skipping insertion in model container [2021-12-17 02:28:44,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:28:44,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:28:44,341 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/ssina.c[588,601] [2021-12-17 02:28:44,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:28:44,374 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:28:44,387 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/ssina.c[588,601] [2021-12-17 02:28:44,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:28:44,417 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:28:44,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44 WrapperNode [2021-12-17 02:28:44,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:28:44,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:28:44,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:28:44,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:28:44,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,451 INFO L137 Inliner]: procedures = 17, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2021-12-17 02:28:44,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:28:44,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:28:44,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:28:44,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:28:44,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:28:44,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:28:44,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:28:44,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:28:44,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (1/1) ... [2021-12-17 02:28:44,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:28:44,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:28:44,511 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-17 02:28:44,535 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-17 02:28:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:28:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 02:28:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 02:28:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 02:28:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 02:28:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:28:44,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:28:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 02:28:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 02:28:44,603 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:28:44,604 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:28:44,717 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:28:44,721 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:28:44,721 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-17 02:28:44,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:28:44 BoogieIcfgContainer [2021-12-17 02:28:44,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:28:44,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:28:44,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:28:44,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:28:44,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:28:44" (1/3) ... [2021-12-17 02:28:44,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157adbf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:28:44, skipping insertion in model container [2021-12-17 02:28:44,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:28:44" (2/3) ... [2021-12-17 02:28:44,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157adbf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:28:44, skipping insertion in model container [2021-12-17 02:28:44,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:28:44" (3/3) ... [2021-12-17 02:28:44,728 INFO L111 eAbstractionObserver]: Analyzing ICFG ssina.c [2021-12-17 02:28:44,731 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:28:44,731 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:28:44,759 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:28:44,763 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-17 02:28:44,763 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:28:44,771 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-17 02:28:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 02:28:44,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:28:44,781 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-17 02:28:44,781 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:28:44,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:28:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash -635308358, now seen corresponding path program 1 times [2021-12-17 02:28:44,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:28:44,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631734656] [2021-12-17 02:28:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:28:44,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:28:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:28:44,925 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-17 02:28:44,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:28:44,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631734656] [2021-12-17 02:28:44,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631734656] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:28:44,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:28:44,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 02:28:44,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731405761] [2021-12-17 02:28:44,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:28:44,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 02:28:44,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:28:44,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 02:28:44,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 02:28:44,956 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-17 02:28:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:28:44,967 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2021-12-17 02:28:44,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 02:28:44,969 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-17 02:28:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:28:44,973 INFO L225 Difference]: With dead ends: 56 [2021-12-17 02:28:44,974 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 02:28:44,976 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-17 02:28:44,981 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-17 02:28:44,981 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-17 02:28:44,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 02:28:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-17 02:28:45,002 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-17 02:28:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-12-17 02:28:45,006 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2021-12-17 02:28:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:28:45,007 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-12-17 02:28:45,007 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-17 02:28:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2021-12-17 02:28:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 02:28:45,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:28:45,009 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-17 02:28:45,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 02:28:45,010 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:28:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:28:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1344199344, now seen corresponding path program 1 times [2021-12-17 02:28:45,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:28:45,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669596237] [2021-12-17 02:28:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:28:45,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:28:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:28:45,102 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-17 02:28:45,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:28:45,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669596237] [2021-12-17 02:28:45,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669596237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:28:45,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:28:45,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:28:45,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646119566] [2021-12-17 02:28:45,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:28:45,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:28:45,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:28:45,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:28:45,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:28:45,108 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-17 02:28:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:28:45,184 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2021-12-17 02:28:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 02:28:45,184 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-17 02:28:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:28:45,187 INFO L225 Difference]: With dead ends: 61 [2021-12-17 02:28:45,187 INFO L226 Difference]: Without dead ends: 42 [2021-12-17 02:28:45,190 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-17 02:28:45,191 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-17 02:28:45,191 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-17 02:28:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-17 02:28:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2021-12-17 02:28:45,197 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-17 02:28:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-12-17 02:28:45,197 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2021-12-17 02:28:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:28:45,198 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-12-17 02:28:45,198 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-17 02:28:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-12-17 02:28:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 02:28:45,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:28:45,199 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-17 02:28:45,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 02:28:45,199 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:28:45,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:28:45,200 INFO L85 PathProgramCache]: Analyzing trace with hash -933126362, now seen corresponding path program 1 times [2021-12-17 02:28:45,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:28:45,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184580781] [2021-12-17 02:28:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:28:45,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:28:45,228 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:28:45,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [214876580] [2021-12-17 02:28:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:28:45,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:28:45,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:28:45,230 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-17 02:28:45,231 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-17 02:28:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:28:45,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-17 02:28:45,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:28:45,362 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-17 02:28:45,372 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-17 02:28:45,442 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-17 02:28:45,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-12-17 02:28:45,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2021-12-17 02:28:45,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-12-17 02:28:45,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-12-17 02:28:45,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2021-12-17 02:28:45,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2021-12-17 02:28:46,020 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-17 02:28:46,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:28:46,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:28:46,984 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-17 02:28:46,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:28:46,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184580781] [2021-12-17 02:28:46,985 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:28:46,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214876580] [2021-12-17 02:28:46,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214876580] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:28:46,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:28:46,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2021-12-17 02:28:46,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003517251] [2021-12-17 02:28:46,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:28:46,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-17 02:28:46,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:28:46,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-17 02:28:46,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2021-12-17 02:28:46,988 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:28:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:28:48,930 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2021-12-17 02:28:48,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-17 02:28:48,931 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-17 02:28:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:28:48,931 INFO L225 Difference]: With dead ends: 58 [2021-12-17 02:28:48,931 INFO L226 Difference]: Without dead ends: 56 [2021-12-17 02:28:48,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2021-12-17 02:28:48,933 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 02:28:48,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 169 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 342 Invalid, 0 Unknown, 61 Unchecked, 0.8s Time] [2021-12-17 02:28:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-17 02:28:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2021-12-17 02:28:48,937 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-17 02:28:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2021-12-17 02:28:48,938 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 28 [2021-12-17 02:28:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:28:48,938 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2021-12-17 02:28:48,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:28:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2021-12-17 02:28:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-17 02:28:48,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:28:48,939 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-17 02:28:48,959 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-17 02:28:49,151 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-17 02:28:49,152 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:28:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:28:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1642466588, now seen corresponding path program 2 times [2021-12-17 02:28:49,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:28:49,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281526888] [2021-12-17 02:28:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:28:49,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:28:49,182 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:28:49,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025421662] [2021-12-17 02:28:49,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:28:49,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:28:49,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:28:49,187 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-17 02:28:49,235 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-17 02:28:49,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:28:49,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:28:49,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:28:49,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:28:49,340 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-17 02:28:49,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:28:49,401 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-17 02:28:49,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:28:49,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281526888] [2021-12-17 02:28:49,402 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:28:49,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025421662] [2021-12-17 02:28:49,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025421662] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:28:49,403 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:28:49,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-12-17 02:28:49,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387202717] [2021-12-17 02:28:49,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:28:49,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 02:28:49,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:28:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 02:28:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:28:49,405 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:28:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:28:49,540 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2021-12-17 02:28:49,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:28:49,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-17 02:28:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:28:49,542 INFO L225 Difference]: With dead ends: 121 [2021-12-17 02:28:49,542 INFO L226 Difference]: Without dead ends: 78 [2021-12-17 02:28:49,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-17 02:28:49,545 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 85 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:28:49,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 47 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:28:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-17 02:28:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2021-12-17 02:28:49,560 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-17 02:28:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2021-12-17 02:28:49,563 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 30 [2021-12-17 02:28:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:28:49,564 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2021-12-17 02:28:49,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:28:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2021-12-17 02:28:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-17 02:28:49,567 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:28:49,567 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-17 02:28:49,593 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-17 02:28:49,793 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-17 02:28:49,794 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:28:49,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:28:49,795 INFO L85 PathProgramCache]: Analyzing trace with hash -396360796, now seen corresponding path program 3 times [2021-12-17 02:28:49,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:28:49,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075490525] [2021-12-17 02:28:49,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:28:49,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:28:49,823 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:28:49,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183774144] [2021-12-17 02:28:49,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:28:49,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:28:49,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:28:49,839 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-17 02:28:49,840 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-17 02:28:49,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 02:28:49,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:28:49,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:28:49,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:28:49,960 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-17 02:28:49,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:28:50,021 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-17 02:28:50,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:28:50,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075490525] [2021-12-17 02:28:50,022 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:28:50,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183774144] [2021-12-17 02:28:50,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183774144] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:28:50,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:28:50,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-12-17 02:28:50,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329525100] [2021-12-17 02:28:50,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:28:50,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 02:28:50,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:28:50,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 02:28:50,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:28:50,024 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:28:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:28:50,141 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2021-12-17 02:28:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:28:50,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-17 02:28:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:28:50,142 INFO L225 Difference]: With dead ends: 74 [2021-12-17 02:28:50,142 INFO L226 Difference]: Without dead ends: 57 [2021-12-17 02:28:50,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:28:50,143 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 127 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:28:50,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 36 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:28:50,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-17 02:28:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2021-12-17 02:28:50,145 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-17 02:28:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2021-12-17 02:28:50,146 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2021-12-17 02:28:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:28:50,146 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2021-12-17 02:28:50,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:28:50,146 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2021-12-17 02:28:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 02:28:50,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:28:50,147 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-17 02:28:50,167 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-17 02:28:50,355 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-17 02:28:50,355 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:28:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:28:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash 389318684, now seen corresponding path program 4 times [2021-12-17 02:28:50,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:28:50,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085671598] [2021-12-17 02:28:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:28:50,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:28:50,378 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:28:50,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695118302] [2021-12-17 02:28:50,379 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:28:50,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:28:50,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:28:50,396 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-17 02:28:50,397 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-17 02:28:50,455 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:28:50,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:28:50,456 WARN L261 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-17 02:28:50,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:28:50,480 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-17 02:28:50,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,498 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-17 02:28:50,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,550 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-17 02:28:50,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:28:50,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,645 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 49 treesize of output 39 [2021-12-17 02:28:50,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:28:50,713 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 63 treesize of output 42 [2021-12-17 02:28:50,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:28:50,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,869 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 59 treesize of output 41 [2021-12-17 02:28:50,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:50,971 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 57 treesize of output 39 [2021-12-17 02:28:51,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,047 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 35 treesize of output 33 [2021-12-17 02:28:51,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:28:51,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,102 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 49 treesize of output 39 [2021-12-17 02:28:51,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,202 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 47 treesize of output 35 [2021-12-17 02:28:51,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:28:51,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,354 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 53 treesize of output 39 [2021-12-17 02:28:51,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,483 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-12-17 02:28:51,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 52 [2021-12-17 02:28:51,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:28:51,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2021-12-17 02:28:51,670 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-17 02:28:51,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:28:53,832 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_236 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_236) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))))) is different from false [2021-12-17 02:29:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-17 02:29:31,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:29:31,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085671598] [2021-12-17 02:29:31,324 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:29:31,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695118302] [2021-12-17 02:29:31,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695118302] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:29:31,325 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:29:31,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2021-12-17 02:29:31,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787325359] [2021-12-17 02:29:31,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:29:31,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-17 02:29:31,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:29:31,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-17 02:29:31,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2036, Unknown=19, NotChecked=92, Total=2352 [2021-12-17 02:29:31,330 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:29:49,828 WARN L838 $PredicateComparison]: unable to prove that (and (< 1 c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse0 6) (= (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|)) (+ .cse0 3))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 3) (<= c_~N~0 2) (= |c_ULTIMATE.start_main_~i~0#1| 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_236 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_236) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1)))))) is different from false [2021-12-17 02:29:51,768 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_236 Int) (|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)) (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_236) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1)))) (forall ((v_ArrVal_236 Int) (|v_ULTIMATE.start_main_~i~0#1_81| Int)) (or (= (select (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_236) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1)) (< |v_ULTIMATE.start_main_~i~0#1_81| 1)))) is different from false [2021-12-17 02:29:53,774 WARN L838 $PredicateComparison]: unable to prove that (and (< 1 c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 6))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 9) (<= c_~N~0 2) (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_236 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_236) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1)))))) is different from false [2021-12-17 02:29:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:29:54,229 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2021-12-17 02:29:54,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-17 02:29:54,230 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-17 02:29:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:29:54,232 INFO L225 Difference]: With dead ends: 97 [2021-12-17 02:29:54,232 INFO L226 Difference]: Without dead ends: 95 [2021-12-17 02:29:54,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 60.2s TimeCoverageRelationStatistics Valid=278, Invalid=3019, Unknown=25, NotChecked=460, Total=3782 [2021-12-17 02:29:54,233 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 746 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:29:54,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 211 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 356 Invalid, 0 Unknown, 746 Unchecked, 0.2s Time] [2021-12-17 02:29:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-17 02:29:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2021-12-17 02:29:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 89 states have internal predecessors, (104), 0 states have call successors, (0), 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-17 02:29:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2021-12-17 02:29:54,243 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 38 [2021-12-17 02:29:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:29:54,243 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2021-12-17 02:29:54,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:29:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2021-12-17 02:29:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 02:29:54,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:29:54,244 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-17 02:29:54,277 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-17 02:29:54,475 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-17 02:29:54,475 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:29:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:29:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1666934362, now seen corresponding path program 5 times [2021-12-17 02:29:54,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:29:54,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866508932] [2021-12-17 02:29:54,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:29:54,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:29:54,511 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:29:54,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478297028] [2021-12-17 02:29:54,512 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:29:54,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:29:54,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:29:54,513 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-17 02:29:54,514 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-17 02:29:54,707 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-17 02:29:54,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:29:54,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:29:54,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:29:54,797 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-17 02:29:54,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:29:54,858 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-17 02:29:54,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:29:54,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866508932] [2021-12-17 02:29:54,858 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:29:54,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478297028] [2021-12-17 02:29:54,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478297028] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:29:54,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:29:54,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2021-12-17 02:29:54,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044684659] [2021-12-17 02:29:54,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:29:54,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 02:29:54,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:29:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 02:29:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-17 02:29:54,860 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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-17 02:29:55,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:29:55,128 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2021-12-17 02:29:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 02:29:55,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 40 [2021-12-17 02:29:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:29:55,129 INFO L225 Difference]: With dead ends: 164 [2021-12-17 02:29:55,129 INFO L226 Difference]: Without dead ends: 122 [2021-12-17 02:29:55,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-12-17 02:29:55,130 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 85 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:29:55,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 136 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:29:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-17 02:29:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 80. [2021-12-17 02:29:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 79 states have internal predecessors, (91), 0 states have call successors, (0), 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-17 02:29:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2021-12-17 02:29:55,136 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 40 [2021-12-17 02:29:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:29:55,136 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2021-12-17 02:29:55,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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-17 02:29:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2021-12-17 02:29:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 02:29:55,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:29:55,137 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-17 02:29:55,158 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-17 02:29:55,347 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-17 02:29:55,347 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:29:55,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:29:55,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1546505432, now seen corresponding path program 6 times [2021-12-17 02:29:55,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:29:55,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477571505] [2021-12-17 02:29:55,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:29:55,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:29:55,373 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:29:55,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206238896] [2021-12-17 02:29:55,379 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:29:55,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:29:55,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:29:55,404 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-17 02:29:55,406 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-17 02:29:55,480 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-17 02:29:55,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:29:55,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:29:55,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:29:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-17 02:29:55,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:29:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-17 02:29:55,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:29:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477571505] [2021-12-17 02:29:55,635 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:29:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206238896] [2021-12-17 02:29:55,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206238896] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:29:55,635 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:29:55,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2021-12-17 02:29:55,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36016740] [2021-12-17 02:29:55,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:29:55,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 02:29:55,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:29:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 02:29:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-17 02:29:55,636 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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-17 02:29:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:29:55,794 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2021-12-17 02:29:55,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 02:29:55,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 42 [2021-12-17 02:29:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:29:55,794 INFO L225 Difference]: With dead ends: 148 [2021-12-17 02:29:55,795 INFO L226 Difference]: Without dead ends: 107 [2021-12-17 02:29:55,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-12-17 02:29:55,795 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 107 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:29:55,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 72 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:29:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-17 02:29:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 82. [2021-12-17 02:29:55,802 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-17 02:29:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2021-12-17 02:29:55,803 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 42 [2021-12-17 02:29:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:29:55,803 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2021-12-17 02:29:55,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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-17 02:29:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2021-12-17 02:29:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 02:29:55,807 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:29:55,807 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-17 02:29:55,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-17 02:29:56,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:29:56,012 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:29:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:29:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash -465930606, now seen corresponding path program 1 times [2021-12-17 02:29:56,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:29:56,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139321461] [2021-12-17 02:29:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:29:56,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:29:56,027 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:29:56,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57254530] [2021-12-17 02:29:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:29:56,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:29:56,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:29:56,042 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:29:56,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 02:29:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:29:56,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-17 02:29:56,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:29:56,174 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-17 02:29:56,206 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 15 treesize of output 11 [2021-12-17 02:29:56,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:56,267 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 21 treesize of output 20 [2021-12-17 02:29:56,361 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-17 02:29:56,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:56,400 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-17 02:29:56,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:29:56,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:56,450 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-17 02:29:56,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:56,521 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-17 02:29:56,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2021-12-17 02:29:56,575 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 11 treesize of output 9 [2021-12-17 02:29:56,609 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 20 treesize of output 20 [2021-12-17 02:29:56,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:56,655 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 25 treesize of output 27 [2021-12-17 02:29:56,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:29:56,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:56,716 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 43 treesize of output 33 [2021-12-17 02:29:56,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:56,806 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 45 treesize of output 31 [2021-12-17 02:29:57,025 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:29:57,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 83 [2021-12-17 02:29:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:29:57,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:29:57,541 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:29:57,541 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 182 treesize of output 152 [2021-12-17 02:30:06,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse1 (select .cse3 .cse4)) (.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (= (+ .cse0 .cse1) .cse2) (not (= (select (store .cse3 .cse4 (+ .cse1 .cse0)) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2))))))) is different from false [2021-12-17 02:30:09,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (store .cse6 .cse7 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse6 .cse7))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse0 (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 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse2 (+ (select .cse0 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse3 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (not (= (select (store .cse0 .cse1 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3)) (= .cse2 .cse3)))))) is different from false [2021-12-17 02:30:09,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse6 (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse7 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (store .cse6 .cse7 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse6 .cse7)))))) |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 .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~#sum~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|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3))) (.cse1 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (= .cse0 .cse1) (not (= (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1))))))) is different from false [2021-12-17 02:30:12,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse7 .cse4 (+ (select .cse7 .cse4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select .cse3 .cse4)) (.cse2 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (= (+ .cse0 .cse1) .cse2) (not (= (select (store .cse3 .cse4 (+ .cse1 .cse0)) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2)))))))) is different from false [2021-12-17 02:30:12,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_431 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse4 (store (let ((.cse6 (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_431)))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_431 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse7 .cse1 (+ (select .cse7 .cse1) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse0 (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 ((.cse2 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse0 .cse1))) (.cse3 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (not (= (select (store .cse0 .cse1 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3)) (= .cse2 .cse3))))))) is different from false [2021-12-17 02:30:12,562 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:30:12,563 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 1380 treesize of output 1098 [2021-12-17 02:30:15,385 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse4 (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse7 .cse1 (+ (select .cse7 .cse1) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse0 (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 ((.cse2 (+ (select .cse0 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse3 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (not (= (select (store .cse0 .cse1 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3)) (= .cse2 .cse3))))))) is different from false [2021-12-17 02:30:18,849 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse4 (store (let ((.cse6 (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_~#sum~0#1.base| v_arrayElimArr_2))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse7 .cse3 (+ (select .cse7 .cse3) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |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|)))))) (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))) (.cse1 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (= .cse0 .cse1) (not (= (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)))))))) is different from false [2021-12-17 02:30:22,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse4 (store (let ((.cse6 (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_~#sum~0#1.base| v_arrayElimArr_2))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse7 .cse1 (+ (select .cse7 .cse1) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse0 (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 ((.cse2 (+ (select .cse0 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse3 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (not (= (select (store .cse0 .cse1 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3)) (= .cse2 .cse3))))))) is different from false [2021-12-17 02:30:22,995 INFO L354 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2021-12-17 02:30:22,996 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 3084 treesize of output 1189 [2021-12-17 02:30:23,029 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 3997 treesize of output 3673 [2021-12-17 02:30:23,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:30:23,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:30:24,863 INFO L354 Elim1Store]: treesize reduction 29, result has 74.8 percent of original size [2021-12-17 02:30:24,864 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 2756 treesize of output 2608 [2021-12-17 02:30:24,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:30:24,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:30:25,233 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:30:25,234 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 3090 treesize of output 2938 [2021-12-17 02:30:25,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:30:25,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:30:25,619 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:30:25,620 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 10762 treesize of output 8958 [2021-12-17 02:30:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-17 02:30:29,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:30:29,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139321461] [2021-12-17 02:30:29,997 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:30:29,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57254530] [2021-12-17 02:30:29,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57254530] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:30:29,997 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:30:29,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2021-12-17 02:30:29,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987081270] [2021-12-17 02:30:29,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:30:29,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-17 02:30:29,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:30:29,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-17 02:30:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=957, Unknown=13, NotChecked=568, Total=1722 [2021-12-17 02:30:29,999 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 42 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 42 states have internal predecessors, (80), 0 states have call successors, (0), 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-17 02:30:36,313 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse18 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse8 (mod c_~N~0 4294967296)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (select .cse6 .cse7)) (.cse3 (<= .cse8 536870911)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse1 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1)) (.cse2 (select .cse6 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (or (= .cse0 .cse1) (not (= .cse2 .cse1))) .cse3 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse4 (store .cse6 .cse7 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse0)))) (or (not (= (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse4 .cse5) .cse1))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (or (and .cse3 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 536870911 .cse8))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse13 (store (let ((.cse15 (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_~#sum~0#1.base| v_arrayElimArr_2))) (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse16 (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse16 .cse10 (+ (select .cse16 .cse10) (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse9 (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse11 (+ (select .cse9 .cse10) (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse12 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (not (= (select (store .cse9 .cse10 .cse11) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse12)) (= .cse11 .cse12))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (or (= (select .cse6 .cse5) .cse1) (not (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1))) (= .cse2 1))))) is different from false [2021-12-17 02:30:39,958 WARN L838 $PredicateComparison]: unable to prove that (and (<= (mod c_~N~0 4294967296) 536870911) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse4 (store (let ((.cse6 (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_~#sum~0#1.base| v_arrayElimArr_2))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse7 .cse3 (+ (select .cse7 .cse3) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |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|)))))) (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))) (.cse1 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (= .cse0 .cse1) (not (= (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)))))))) (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)) is different from false [2021-12-17 02:30:44,052 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse5 (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse8 .cse2 (+ (select .cse8 .cse2) (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse1 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse3 (+ (select .cse1 .cse2) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse4 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (not (= (select (store .cse1 .cse2 .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse4)) (= .cse3 .cse4))))))) (<= (mod c_~N~0 4294967296) 536870911) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 |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|)))) is different from false [2021-12-17 02:30:48,361 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse5 (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse8 .cse2 (+ (select .cse8 .cse2) (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse1 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse3 (+ (select .cse1 .cse2) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse4 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (or (not (= (select (store .cse1 .cse2 .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse4)) (= .cse3 .cse4))))))) (<= (mod c_~N~0 4294967296) 536870911) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 |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|)) (= |c_ULTIMATE.start_main_~i~0#1| 0))) is different from false [2021-12-17 02:31:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:31:09,848 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2021-12-17 02:31:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-17 02:31:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 42 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-17 02:31:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:31:09,850 INFO L225 Difference]: With dead ends: 84 [2021-12-17 02:31:09,850 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 02:31:09,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 55.8s TimeCoverageRelationStatistics Valid=369, Invalid=1824, Unknown=17, NotChecked=1212, Total=3422 [2021-12-17 02:31:09,851 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2021-12-17 02:31:09,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 152 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 527 Invalid, 0 Unknown, 315 Unchecked, 9.5s Time] [2021-12-17 02:31:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 02:31:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-17 02:31:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:31:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2021-12-17 02:31:09,856 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 42 [2021-12-17 02:31:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:31:09,857 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2021-12-17 02:31:09,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 42 states have internal predecessors, (80), 0 states have call successors, (0), 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-17 02:31:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-12-17 02:31:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 02:31:09,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:31:09,857 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:31:09,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 02:31:10,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:31:10,068 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:31:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:31:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash 383514002, now seen corresponding path program 7 times [2021-12-17 02:31:10,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:31:10,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688597475] [2021-12-17 02:31:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:31:10,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:31:10,089 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:31:10,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1018273636] [2021-12-17 02:31:10,103 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 02:31:10,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:31:10,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:31:10,119 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:31:10,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 02:31:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:31:10,205 WARN L261 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-17 02:31:10,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:31:10,266 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-17 02:31:10,382 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-17 02:31:10,761 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-17 02:31:11,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:11,688 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 30 treesize of output 32 [2021-12-17 02:31:13,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:13,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:13,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:13,056 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 42 treesize of output 47 [2021-12-17 02:31:16,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:16,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:31:16,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:16,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:16,454 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2021-12-17 02:31:18,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:18,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:18,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:18,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:18,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:18,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:31:18,321 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2021-12-17 02:31:20,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:20,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:20,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:20,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2021-12-17 02:31:23,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:23,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:31:23,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:23,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:23,309 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2021-12-17 02:31:25,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:25,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:25,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:25,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:25,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:25,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:31:25,532 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2021-12-17 02:31:28,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:28,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:28,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:28,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2021-12-17 02:31:29,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:29,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:29,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:29,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2021-12-17 02:31:31,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:31,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:31:31,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:31,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:31,331 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2021-12-17 02:31:34,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:34,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:34,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:34,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:34,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:34,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:31:34,121 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2021-12-17 02:31:37,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:37,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:37,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:37,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2021-12-17 02:31:40,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:40,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:31:40,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:40,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:40,569 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2021-12-17 02:31:43,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:43,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:43,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:43,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:43,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:43,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:31:43,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2021-12-17 02:31:46,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:46,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:31:47,224 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-12-17 02:31:47,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 52 [2021-12-17 02:31:50,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2021-12-17 02:31:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:31:51,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:31:59,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_159| Int)) (or (forall ((v_ArrVal_555 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_159| 8)) v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (< |v_ULTIMATE.start_main_~i~0#1_159| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:39:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 02:39:30,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:39:30,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688597475] [2021-12-17 02:39:30,702 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:39:30,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018273636] [2021-12-17 02:39:30,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018273636] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:39:30,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:39:30,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 69 [2021-12-17 02:39:30,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158613705] [2021-12-17 02:39:30,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:39:30,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-12-17 02:39:30,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:39:30,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-12-17 02:39:30,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=4186, Unknown=89, NotChecked=132, Total=4692 [2021-12-17 02:39:30,704 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 69 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:40:25,972 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) 4) (< 2 c_~N~0) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 16) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 4) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~#sum~0#1.base|)))) (<= c_~N~0 3) (forall ((|v_ULTIMATE.start_main_~i~0#1_159| Int)) (or (forall ((v_ArrVal_555 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_159| 8)) v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (< |v_ULTIMATE.start_main_~i~0#1_159| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2021-12-17 02:40:28,004 WARN L838 $PredicateComparison]: unable to prove that (and (< 2 c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 16) (forall ((v_ArrVal_555 Int) (v_ArrVal_554 Int) (|v_ULTIMATE.start_main_~i~0#1_159| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_159| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (select (store (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) v_ArrVal_554) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_159| 8)) v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 4) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~#sum~0#1.base|)))) (<= c_~N~0 3) (forall ((|v_ULTIMATE.start_main_~i~0#1_159| Int)) (or (forall ((v_ArrVal_555 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_159| 8)) v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (< |v_ULTIMATE.start_main_~i~0#1_159| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-12-17 02:40:30,032 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_555 Int) (v_ArrVal_554 Int) (|v_ULTIMATE.start_main_~i~0#1_159| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_159| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (select (store (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) v_ArrVal_554) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_159| 8)) v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_159| Int)) (or (forall ((v_ArrVal_555 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_159| 8)) v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0) 1))) (< |v_ULTIMATE.start_main_~i~0#1_159| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-12-17 02:40:41,937 WARN L227 SmtUtils]: Spent 8.97s on a formula simplification. DAG size of input: 47 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:40:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:40:42,492 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2021-12-17 02:40:42,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-12-17 02:40:42,493 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-17 02:40:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:40:42,494 INFO L225 Difference]: With dead ends: 116 [2021-12-17 02:40:42,494 INFO L226 Difference]: Without dead ends: 114 [2021-12-17 02:40:42,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 528.8s TimeCoverageRelationStatistics Valid=342, Invalid=5131, Unknown=93, NotChecked=596, Total=6162 [2021-12-17 02:40:42,495 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1095 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:40:42,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 269 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 490 Invalid, 0 Unknown, 1095 Unchecked, 9.0s Time] [2021-12-17 02:40:42,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-17 02:40:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2021-12-17 02:40:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 91 states have internal predecessors, (104), 0 states have call successors, (0), 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-17 02:40:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2021-12-17 02:40:42,502 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 48 [2021-12-17 02:40:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:40:42,502 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2021-12-17 02:40:42,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:40:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2021-12-17 02:40:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-17 02:40:42,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:40:42,503 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:40:42,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 02:40:42,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 02:40:42,704 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:40:42,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:40:42,704 INFO L85 PathProgramCache]: Analyzing trace with hash 686177872, now seen corresponding path program 8 times [2021-12-17 02:40:42,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:40:42,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810687154] [2021-12-17 02:40:42,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:40:42,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:40:42,730 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:40:42,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420429568] [2021-12-17 02:40:42,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:40:42,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:40:42,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:40:42,771 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:40:42,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 02:40:42,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:40:42,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:40:42,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 02:40:42,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:40:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-17 02:40:46,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:40:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-17 02:40:48,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:40:48,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810687154] [2021-12-17 02:40:48,342 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:40:48,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420429568] [2021-12-17 02:40:48,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420429568] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:40:48,342 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:40:48,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-12-17 02:40:48,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552679836] [2021-12-17 02:40:48,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:40:48,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 02:40:48,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:40:48,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 02:40:48,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-12-17 02:40:48,343 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:40:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:40:53,883 INFO L93 Difference]: Finished difference Result 228 states and 253 transitions. [2021-12-17 02:40:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 02:40:53,884 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-12-17 02:40:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:40:53,885 INFO L225 Difference]: With dead ends: 228 [2021-12-17 02:40:53,885 INFO L226 Difference]: Without dead ends: 169 [2021-12-17 02:40:53,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2021-12-17 02:40:53,886 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 239 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:40:53,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 81 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2021-12-17 02:40:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-17 02:40:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 131. [2021-12-17 02:40:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.1) internal successors, (143), 130 states have internal predecessors, (143), 0 states have call successors, (0), 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-17 02:40:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2021-12-17 02:40:53,893 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 50 [2021-12-17 02:40:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:40:53,894 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2021-12-17 02:40:53,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:40:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2021-12-17 02:40:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-17 02:40:53,894 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:40:53,895 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:40:53,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 02:40:54,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:40:54,110 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:40:54,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:40:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1057566480, now seen corresponding path program 9 times [2021-12-17 02:40:54,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:40:54,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660772964] [2021-12-17 02:40:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:40:54,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:40:54,135 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:40:54,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668005424] [2021-12-17 02:40:54,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:40:54,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:40:54,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:40:54,137 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:40:54,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 02:40:54,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-17 02:40:54,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:40:54,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 02:40:54,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:40:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-17 02:40:57,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:40:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-17 02:40:59,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:40:59,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660772964] [2021-12-17 02:40:59,319 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:40:59,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668005424] [2021-12-17 02:40:59,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668005424] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:40:59,319 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:40:59,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-12-17 02:40:59,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922180905] [2021-12-17 02:40:59,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:40:59,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 02:40:59,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:40:59,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 02:40:59,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-12-17 02:40:59,320 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:41:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:41:08,028 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2021-12-17 02:41:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 02:41:08,029 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-12-17 02:41:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:41:08,029 INFO L225 Difference]: With dead ends: 173 [2021-12-17 02:41:08,029 INFO L226 Difference]: Without dead ends: 136 [2021-12-17 02:41:08,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2021-12-17 02:41:08,030 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 195 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2021-12-17 02:41:08,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 133 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2021-12-17 02:41:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-17 02:41:08,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2021-12-17 02:41:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 103 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-17 02:41:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2021-12-17 02:41:08,036 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 50 [2021-12-17 02:41:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:41:08,036 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2021-12-17 02:41:08,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:41:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2021-12-17 02:41:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-17 02:41:08,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:41:08,037 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:41:08,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 02:41:08,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 02:41:08,237 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:41:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:41:08,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1092470520, now seen corresponding path program 2 times [2021-12-17 02:41:08,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:41:08,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593873872] [2021-12-17 02:41:08,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:41:08,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:41:08,255 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:41:08,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699382770] [2021-12-17 02:41:08,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:41:08,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:41:08,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:41:08,261 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:41:08,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 02:41:08,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:41:08,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:41:08,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-17 02:41:08,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:41:08,673 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 15 treesize of output 11 [2021-12-17 02:41:09,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:09,567 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-17 02:41:10,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:10,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:10,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:10,594 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 32 treesize of output 34 [2021-12-17 02:41:11,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:11,997 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-17 02:41:12,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:12,366 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-17 02:41:12,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:12,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:12,669 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-17 02:41:13,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:13,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:41:13,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:13,427 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-17 02:41:14,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:14,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:14,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:14,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:41:14,741 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 57 treesize of output 41 [2021-12-17 02:41:16,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:16,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:16,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:16,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:16,267 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 44 treesize of output 43 [2021-12-17 02:41:17,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:17,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2021-12-17 02:41:17,300 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 11 treesize of output 9 [2021-12-17 02:41:18,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:18,025 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 20 treesize of output 20 [2021-12-17 02:41:18,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:18,726 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 20 treesize of output 20 [2021-12-17 02:41:19,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:19,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:19,065 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 25 treesize of output 27 [2021-12-17 02:41:19,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:19,527 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:41:19,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:19,545 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 43 treesize of output 33 [2021-12-17 02:41:21,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:21,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:21,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:21,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:41:21,122 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 54 treesize of output 38 [2021-12-17 02:41:22,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:22,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:22,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:41:22,459 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:41:22,459 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 1 case distinctions, treesize of input 29 treesize of output 31 [2021-12-17 02:41:26,527 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:41:26,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 44 [2021-12-17 02:41:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:41:27,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:41:48,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (~N~0 Int) (v_ArrVal_824 Int)) (let ((.cse0 (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_246| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse1)))) is different from false [2021-12-17 02:41:50,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (~N~0 Int) (v_ArrVal_824 Int)) (let ((.cse0 (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (store .cse2 .cse3 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_246| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse1)))) is different from false [2021-12-17 02:42:20,560 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:42:20,561 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 228 treesize of output 192 [2021-12-17 02:42:20,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse3 .cse2 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse2))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse0 .cse2) .cse1))))) is different from false [2021-12-17 02:42:21,284 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (v_ArrVal_824 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse3 .cse1 (+ (select .cse3 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse2 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (= (select .cse0 .cse1) .cse2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2)))))) is different from false [2021-12-17 02:42:22,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (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|) v_ArrVal_813)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse3 .cse1 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse1))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse2 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (= (select .cse0 .cse1) .cse2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2)))))) is different from false [2021-12-17 02:42:23,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_254| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse3 .cse1 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse1))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse2 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (= (select .cse0 .cse1) .cse2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_246| 2))))) (< |v_ULTIMATE.start_main_~i~0#1_254| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:42:23,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse3 .cse2 (+ (select .cse3 .cse2) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse0 .cse2) .cse1) (< |v_ULTIMATE.start_main_~i~0#1_254| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from false [2021-12-17 02:42:24,590 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (store .cse6 .cse7 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse6 .cse7)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse3 .cse2 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse2))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse0 .cse2) .cse1) (< |v_ULTIMATE.start_main_~i~0#1_254| (+ |c_ULTIMATE.start_main_~i~0#1| 2)))))) is different from false [2021-12-17 02:42:25,676 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse6 (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse7 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (store .cse6 .cse7 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse6 .cse7))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse3 .cse2 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse2))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (< |v_ULTIMATE.start_main_~i~0#1_254| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (select .cse0 .cse2) .cse1))))) is different from false [2021-12-17 02:42:26,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse6 (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse6 .cse2 (+ (select .cse6 .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse3 .cse2 (+ (select .cse3 .cse2) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_254| 2) (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (= (select .cse0 .cse2) .cse1))))) is different from false [2021-12-17 02:42:29,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_ArrVal_808 Int) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (let ((.cse6 (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_808)))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_808 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse7 .cse2 (+ (select .cse7 .cse2) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse3 .cse2 (+ (select .cse3 .cse2) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_254| 2) (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse0 .cse2) .cse1))))) is different from false [2021-12-17 02:42:30,449 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:42:30,449 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 1724 treesize of output 1394 [2021-12-17 02:42:31,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_5 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse7 .cse2 (+ (select .cse7 .cse2) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse3 .cse2 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse2))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_254| 2) (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse0 .cse2) .cse1))))) is different from false [2021-12-17 02:42:36,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_803 Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (let ((.cse6 (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|) v_ArrVal_803)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_5 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse7 .cse2 (+ (select .cse7 .cse2) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse3 .cse2 (+ (select .cse3 .cse2) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_254| 2) (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse0 .cse2) .cse1))))) is different from false [2021-12-17 02:42:38,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_262| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_803 Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_262| 8)) v_ArrVal_803)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_5 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse7 .cse2 (+ (select .cse7 .cse2) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse3 .cse2 (+ (select .cse3 .cse2) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_254| 2) (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse0 .cse2) .cse1))))) (< |v_ULTIMATE.start_main_~i~0#1_262| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:42:39,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_262| Int) (v_ArrVal_803 Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_262| 8)) v_ArrVal_803)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_5 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse7 .cse2 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse2)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse3 .cse2 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse2))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_254| 2) (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (< |v_ULTIMATE.start_main_~i~0#1_262| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse0 .cse2) .cse1))))) is different from false [2021-12-17 02:42:41,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_262| Int) (v_ArrVal_803 Int) (v_ArrVal_813 Int) (v_ArrVal_824 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_262| 8)) v_ArrVal_803)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_5 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse7 .cse2 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse2)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 8)) v_ArrVal_813))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (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_4 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse3 .cse2 (+ (select .cse3 .cse2) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_824)) (.cse1 (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1))) (or (< |v_ULTIMATE.start_main_~i~0#1_254| 2) (< |v_ULTIMATE.start_main_~i~0#1_246| 2) (< |v_ULTIMATE.start_main_~i~0#1_262| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (= (select .cse0 .cse2) .cse1))))) is different from false [2021-12-17 02:42:42,304 INFO L354 Elim1Store]: treesize reduction 127, result has 23.0 percent of original size [2021-12-17 02:42:42,305 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 3 case distinctions, treesize of input 4496 treesize of output 1509 [2021-12-17 02:42:42,354 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 5389 treesize of output 4985 [2021-12-17 02:42:42,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:42,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:42,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:42,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:42,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:42,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:45,036 INFO L354 Elim1Store]: treesize reduction 29, result has 74.8 percent of original size [2021-12-17 02:42:45,037 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 8852 treesize of output 7800 [2021-12-17 02:42:45,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:45,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:45,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:45,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:45,578 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:42:45,578 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 8758 treesize of output 8454 [2021-12-17 02:42:45,629 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:45,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:45,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:45,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:45,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:45,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:46,097 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:42:46,098 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 15618 treesize of output 13348 [2021-12-17 02:42:48,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:42:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593873872] [2021-12-17 02:42:48,622 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:42:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699382770] [2021-12-17 02:42:48,622 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 02:42:48,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:42:48,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-17 02:42:48,622 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-12-17 02:42:48,622 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-17 02:42:48,627 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 02:42:48,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-17 02:42:48,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 02:42:48,847 INFO L732 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1] [2021-12-17 02:42:48,849 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 02:42:48,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 02:42:48 BoogieIcfgContainer [2021-12-17 02:42:48,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 02:42:48,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 02:42:48,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 02:42:48,865 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 02:42:48,865 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:28:44" (3/4) ... [2021-12-17 02:42:48,867 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 02:42:48,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 02:42:48,868 INFO L158 Benchmark]: Toolchain (without parser) took 844696.15ms. Allocated memory was 83.9MB in the beginning and 132.1MB in the end (delta: 48.2MB). Free memory was 53.1MB in the beginning and 86.7MB in the end (delta: -33.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2021-12-17 02:42:48,868 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 42.2MB in the beginning and 42.2MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 02:42:48,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.33ms. Allocated memory is still 83.9MB. Free memory was 52.9MB in the beginning and 60.0MB in the end (delta: -7.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2021-12-17 02:42:48,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.07ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 58.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 02:42:48,869 INFO L158 Benchmark]: Boogie Preprocessor took 30.78ms. Allocated memory is still 83.9MB. Free memory was 58.1MB in the beginning and 57.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 02:42:48,869 INFO L158 Benchmark]: RCFGBuilder took 239.31ms. Allocated memory is still 83.9MB. Free memory was 56.7MB in the beginning and 45.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 02:42:48,869 INFO L158 Benchmark]: TraceAbstraction took 844140.43ms. Allocated memory was 83.9MB in the beginning and 132.1MB in the end (delta: 48.2MB). Free memory was 45.4MB in the beginning and 86.7MB in the end (delta: -41.3MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2021-12-17 02:42:48,869 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 132.1MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 02:42:48,870 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 42.2MB in the beginning and 42.2MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.33ms. Allocated memory is still 83.9MB. Free memory was 52.9MB in the beginning and 60.0MB in the end (delta: -7.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.07ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 58.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.78ms. Allocated memory is still 83.9MB. Free memory was 58.1MB in the beginning and 57.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 239.31ms. Allocated memory is still 83.9MB. Free memory was 56.7MB in the beginning and 45.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 844140.43ms. Allocated memory was 83.9MB in the beginning and 132.1MB in the end (delta: 48.2MB). Free memory was 45.4MB in the beginning and 86.7MB in the end (delta: -41.3MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 132.1MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 15]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long sum[1]; [L29] long long *a = malloc(sizeof(long long)*N); [L31] sum[0] = 0 [L32] i=0 [L32] COND TRUE i 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 -> 4c9ca6c94ff0fae82185b19014fc033eef7a37c04f3b092e10c4eebb38e41241 [2021-12-17 02:42:51,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:42:51,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:42:51,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:42:51,106 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:42:51,107 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:42:51,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ssina.c [2021-12-17 02:42:51,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bda31a4f/3028f7cd2d6646a6a01f6322448facdf/FLAGf40b6370e [2021-12-17 02:42:51,462 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:42:51,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ssina.c [2021-12-17 02:42:51,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bda31a4f/3028f7cd2d6646a6a01f6322448facdf/FLAGf40b6370e [2021-12-17 02:42:51,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bda31a4f/3028f7cd2d6646a6a01f6322448facdf [2021-12-17 02:42:51,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:42:51,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:42:51,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:42:51,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:42:51,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:42:51,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:42:51" (1/1) ... [2021-12-17 02:42:51,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99f3a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:51, skipping insertion in model container [2021-12-17 02:42:51,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:42:51" (1/1) ... [2021-12-17 02:42:51,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:42:51,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:42:51,999 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/ssina.c[588,601] [2021-12-17 02:42:52,031 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:42:52,041 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:42:52,072 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/ssina.c[588,601] [2021-12-17 02:42:52,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:42:52,089 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:42:52,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52 WrapperNode [2021-12-17 02:42:52,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:42:52,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:42:52,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:42:52,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:42:52,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (1/1) ... [2021-12-17 02:42:52,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (1/1) ... [2021-12-17 02:42:52,123 INFO L137 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 110 [2021-12-17 02:42:52,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:42:52,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:42:52,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:42:52,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:42:52,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (1/1) ... [2021-12-17 02:42:52,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (1/1) ... [2021-12-17 02:42:52,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (1/1) ... [2021-12-17 02:42:52,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (1/1) ... [2021-12-17 02:42:52,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (1/1) ... [2021-12-17 02:42:52,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (1/1) ... [2021-12-17 02:42:52,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (1/1) ... [2021-12-17 02:42:52,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:42:52,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:42:52,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:42:52,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:42:52,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (1/1) ... [2021-12-17 02:42:52,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:42:52,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:42:52,163 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-17 02:42:52,212 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-17 02:42:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:42:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 02:42:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 02:42:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-12-17 02:42:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 02:42:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:42:52,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:42:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-12-17 02:42:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 02:42:52,261 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:42:52,262 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:42:52,515 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:42:52,519 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:42:52,519 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-17 02:42:52,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:42:52 BoogieIcfgContainer [2021-12-17 02:42:52,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:42:52,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:42:52,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:42:52,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:42:52,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:42:51" (1/3) ... [2021-12-17 02:42:52,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b541e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:42:52, skipping insertion in model container [2021-12-17 02:42:52,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:42:52" (2/3) ... [2021-12-17 02:42:52,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b541e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:42:52, skipping insertion in model container [2021-12-17 02:42:52,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:42:52" (3/3) ... [2021-12-17 02:42:52,541 INFO L111 eAbstractionObserver]: Analyzing ICFG ssina.c [2021-12-17 02:42:52,545 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:42:52,545 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:42:52,581 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:42:52,593 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-17 02:42:52,594 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:42:52,605 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-17 02:42:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 02:42:52,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:42:52,609 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-17 02:42:52,610 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:42:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:42:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash -635308358, now seen corresponding path program 1 times [2021-12-17 02:42:52,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:42:52,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543514581] [2021-12-17 02:42:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:42:52,624 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:42:52,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:42:52,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:42:52,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 02:42:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:42:52,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 02:42:52,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:42:52,766 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-17 02:42:52,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 02:42:52,767 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:42:52,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543514581] [2021-12-17 02:42:52,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543514581] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:42:52,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:42:52,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 02:42:52,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601091281] [2021-12-17 02:42:52,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:42:52,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 02:42:52,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:42:52,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 02:42:52,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 02:42:52,796 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-17 02:42:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:42:52,813 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2021-12-17 02:42:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 02:42:52,815 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-17 02:42:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:42:52,824 INFO L225 Difference]: With dead ends: 56 [2021-12-17 02:42:52,824 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 02:42:52,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-17 02:42:52,830 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-17 02:42:52,831 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-17 02:42:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 02:42:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-17 02:42:52,862 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-17 02:42:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-12-17 02:42:52,864 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2021-12-17 02:42:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:42:52,864 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-12-17 02:42:52,864 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-17 02:42:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2021-12-17 02:42:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 02:42:52,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:42:52,866 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-17 02:42:52,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-17 02:42:53,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:42:53,079 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:42:53,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:42:53,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1344199344, now seen corresponding path program 1 times [2021-12-17 02:42:53,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:42:53,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561103992] [2021-12-17 02:42:53,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:42:53,082 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:42:53,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:42:53,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:42:53,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 02:42:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:42:53,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:42:53,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:42:53,259 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-17 02:42:53,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 02:42:53,259 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:42:53,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561103992] [2021-12-17 02:42:53,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561103992] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:42:53,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:42:53,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 02:42:53,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733894808] [2021-12-17 02:42:53,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:42:53,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 02:42:53,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:42:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 02:42:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:42:53,262 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-17 02:42:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:42:53,442 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2021-12-17 02:42:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 02:42:53,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-17 02:42:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:42:53,447 INFO L225 Difference]: With dead ends: 61 [2021-12-17 02:42:53,448 INFO L226 Difference]: Without dead ends: 42 [2021-12-17 02:42:53,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:42:53,449 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 70 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:42:53,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 16 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:42:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-17 02:42:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2021-12-17 02:42:53,453 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-17 02:42:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-12-17 02:42:53,454 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2021-12-17 02:42:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:42:53,454 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-12-17 02:42:53,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-17 02:42:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-12-17 02:42:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 02:42:53,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:42:53,455 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-17 02:42:53,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 02:42:53,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:42:53,655 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:42:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:42:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash -933126362, now seen corresponding path program 1 times [2021-12-17 02:42:53,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:42:53,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488280606] [2021-12-17 02:42:53,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:42:53,663 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:42:53,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:42:53,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:42:53,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 02:42:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:42:53,865 WARN L261 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-17 02:42:53,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:42:53,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:53,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:53,973 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 18 treesize of output 19 [2021-12-17 02:42:53,996 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-17 02:42:54,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 50 [2021-12-17 02:42:54,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:54,349 INFO L354 Elim1Store]: treesize reduction 60, result has 25.9 percent of original size [2021-12-17 02:42:54,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 107 treesize of output 67 [2021-12-17 02:42:54,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 81 [2021-12-17 02:42:54,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:54,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,692 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:54,714 INFO L354 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2021-12-17 02:42:54,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 135 treesize of output 131 [2021-12-17 02:42:54,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:54,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:42:54,814 INFO L354 Elim1Store]: treesize reduction 60, result has 25.9 percent of original size [2021-12-17 02:42:54,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 167 treesize of output 127 [2021-12-17 02:42:55,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:42:55,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 199 [2021-12-17 02:42:55,310 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-12-17 02:42:55,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 511 treesize of output 475 [2021-12-17 02:42:55,380 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-17 02:42:55,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... Killed by 15