./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/forester-heap/sll-queue-2.i -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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5083763cd1026dac92f37bc5a05779baf01a71b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 16:59:10,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:59:10,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:59:10,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:59:10,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:59:10,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:59:10,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:59:10,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:59:10,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:59:10,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:59:10,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:59:10,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:59:10,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:59:10,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:59:10,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:59:10,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:59:10,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:59:10,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:59:10,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:59:10,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:59:10,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:59:10,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:59:10,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:59:10,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:59:10,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:59:10,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:59:10,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:59:10,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:59:10,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:59:10,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:59:10,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:59:10,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:59:10,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:59:10,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:59:10,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:59:10,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:59:10,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:59:10,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:59:10,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:59:10,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:59:10,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:59:10,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:59:10,916 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:59:10,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:59:10,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:59:10,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:59:10,918 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:59:10,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:59:10,919 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:59:10,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:59:10,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:59:10,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:59:10,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:59:10,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:59:10,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:59:10,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:59:10,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:59:10,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:59:10,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:59:10,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:59:10,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:59:10,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:59:10,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:59:10,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:59:10,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:59:10,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:59:10,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:59:10,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:59:10,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:59:10,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:59:10,927 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:59:10,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> e5083763cd1026dac92f37bc5a05779baf01a71b [2019-11-28 16:59:11,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:59:11,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:59:11,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:59:11,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:59:11,249 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:59:11,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2019-11-28 16:59:11,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a27722e/a7646a66dedf4be387eee4560a7356b2/FLAG7be4e6161 [2019-11-28 16:59:11,862 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:59:11,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2019-11-28 16:59:11,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a27722e/a7646a66dedf4be387eee4560a7356b2/FLAG7be4e6161 [2019-11-28 16:59:12,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a27722e/a7646a66dedf4be387eee4560a7356b2 [2019-11-28 16:59:12,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:59:12,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:59:12,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:59:12,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:59:12,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:59:12,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5438bd97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12, skipping insertion in model container [2019-11-28 16:59:12,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:59:12,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:59:12,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:59:12,668 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:59:12,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:59:12,810 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:59:12,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12 WrapperNode [2019-11-28 16:59:12,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:59:12,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:59:12,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:59:12,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:59:12,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:59:12,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:59:12,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:59:12,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:59:12,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (1/1) ... [2019-11-28 16:59:12,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:59:12,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:59:12,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:59:12,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:59:12,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:59:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:59:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:59:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 16:59:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 16:59:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 16:59:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:59:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:59:12,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:59:13,566 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:59:13,566 INFO L287 CfgBuilder]: Removed 35 assume(true) statements. [2019-11-28 16:59:13,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:59:13 BoogieIcfgContainer [2019-11-28 16:59:13,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:59:13,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:59:13,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:59:13,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:59:13,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:59:12" (1/3) ... [2019-11-28 16:59:13,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2519306c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:59:13, skipping insertion in model container [2019-11-28 16:59:13,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:12" (2/3) ... [2019-11-28 16:59:13,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2519306c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:59:13, skipping insertion in model container [2019-11-28 16:59:13,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:59:13" (3/3) ... [2019-11-28 16:59:13,576 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2019-11-28 16:59:13,585 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:59:13,593 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-28 16:59:13,605 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-28 16:59:13,628 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:59:13,628 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:59:13,628 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:59:13,628 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:59:13,628 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:59:13,629 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:59:13,629 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:59:13,629 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:59:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-28 16:59:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 16:59:13,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:13,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 16:59:13,653 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:13,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:13,660 INFO L82 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2019-11-28 16:59:13,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:13,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864016024] [2019-11-28 16:59:13,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:13,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864016024] [2019-11-28 16:59:13,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:13,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:59:13,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970261094] [2019-11-28 16:59:13,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:59:13,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:13,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:59:13,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:59:13,832 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2019-11-28 16:59:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:13,863 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2019-11-28 16:59:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:59:13,865 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-28 16:59:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:13,878 INFO L225 Difference]: With dead ends: 168 [2019-11-28 16:59:13,878 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 16:59:13,882 INFO L630 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 [2019-11-28 16:59:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 16:59:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 16:59:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 16:59:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-11-28 16:59:13,928 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2019-11-28 16:59:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:13,929 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-11-28 16:59:13,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:59:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-11-28 16:59:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 16:59:13,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:13,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 16:59:13,931 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:13,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:13,931 INFO L82 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2019-11-28 16:59:13,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:13,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640924434] [2019-11-28 16:59:13,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:13,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640924434] [2019-11-28 16:59:13,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:13,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:14,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329038941] [2019-11-28 16:59:14,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:14,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:14,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:14,006 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 3 states. [2019-11-28 16:59:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:14,084 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-28 16:59:14,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:14,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 16:59:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:14,087 INFO L225 Difference]: With dead ends: 80 [2019-11-28 16:59:14,088 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 16:59:14,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 16:59:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-28 16:59:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 16:59:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-11-28 16:59:14,107 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2019-11-28 16:59:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:14,107 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-11-28 16:59:14,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-11-28 16:59:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 16:59:14,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:14,110 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:14,111 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2019-11-28 16:59:14,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:14,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390390799] [2019-11-28 16:59:14,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:14,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390390799] [2019-11-28 16:59:14,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:14,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:14,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669474563] [2019-11-28 16:59:14,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:14,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:14,196 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 3 states. [2019-11-28 16:59:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:14,250 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-28 16:59:14,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:14,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 16:59:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:14,253 INFO L225 Difference]: With dead ends: 70 [2019-11-28 16:59:14,253 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 16:59:14,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 16:59:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 16:59:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 16:59:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-11-28 16:59:14,263 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2019-11-28 16:59:14,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:14,263 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-11-28 16:59:14,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-11-28 16:59:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 16:59:14,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:14,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:14,265 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2019-11-28 16:59:14,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:14,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743918045] [2019-11-28 16:59:14,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:14,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743918045] [2019-11-28 16:59:14,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:14,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:14,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170104660] [2019-11-28 16:59:14,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:14,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:14,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:14,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:14,330 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 3 states. [2019-11-28 16:59:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:14,378 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2019-11-28 16:59:14,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:14,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-28 16:59:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:14,381 INFO L225 Difference]: With dead ends: 153 [2019-11-28 16:59:14,381 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 16:59:14,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 16:59:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-11-28 16:59:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 16:59:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-28 16:59:14,394 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2019-11-28 16:59:14,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:14,396 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-28 16:59:14,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-28 16:59:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 16:59:14,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:14,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:14,399 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:14,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:14,399 INFO L82 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2019-11-28 16:59:14,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:14,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961671635] [2019-11-28 16:59:14,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:14,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961671635] [2019-11-28 16:59:14,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:14,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:59:14,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942300819] [2019-11-28 16:59:14,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:59:14,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:14,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:59:14,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:59:14,560 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2019-11-28 16:59:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:14,725 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-11-28 16:59:14,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:59:14,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 16:59:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:14,727 INFO L225 Difference]: With dead ends: 91 [2019-11-28 16:59:14,727 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 16:59:14,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:59:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 16:59:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 16:59:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 16:59:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2019-11-28 16:59:14,736 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2019-11-28 16:59:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:14,736 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2019-11-28 16:59:14,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:59:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2019-11-28 16:59:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 16:59:14,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:14,738 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:14,738 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:14,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:14,739 INFO L82 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2019-11-28 16:59:14,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:14,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873704204] [2019-11-28 16:59:14,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:14,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873704204] [2019-11-28 16:59:14,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134365706] [2019-11-28 16:59:14,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:14,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 16:59:14,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:15,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 16:59:15,047 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:15,059 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:15,060 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:15,060 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:59:15,087 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:15,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:59:15,089 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:15,097 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:15,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 16:59:15,103 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:15,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:15,114 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:15,114 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-11-28 16:59:15,230 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-28 16:59:15,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-11-28 16:59:15,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:15,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-28 16:59:15,274 INFO L614 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2019-11-28 16:59:15,276 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:15,276 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-11-28 16:59:15,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:15,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-11-28 16:59:15,384 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:15,398 INFO L614 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-28 16:59:15,399 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:15,400 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-28 16:59:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:15,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:15,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-28 16:59:15,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773558058] [2019-11-28 16:59:15,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 16:59:15,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:15,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 16:59:15,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:59:15,421 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 9 states. [2019-11-28 16:59:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:15,696 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2019-11-28 16:59:15,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:59:15,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-28 16:59:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:15,699 INFO L225 Difference]: With dead ends: 134 [2019-11-28 16:59:15,699 INFO L226 Difference]: Without dead ends: 132 [2019-11-28 16:59:15,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 16:59:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-28 16:59:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 84. [2019-11-28 16:59:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 16:59:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-11-28 16:59:15,711 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2019-11-28 16:59:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:15,711 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-11-28 16:59:15,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 16:59:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-11-28 16:59:15,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:59:15,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:15,713 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:15,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:15,925 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:15,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:15,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2019-11-28 16:59:15,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:15,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436497019] [2019-11-28 16:59:15,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:15,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436497019] [2019-11-28 16:59:15,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:15,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:15,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808236473] [2019-11-28 16:59:15,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:15,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:15,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:15,988 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 3 states. [2019-11-28 16:59:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:16,040 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2019-11-28 16:59:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:16,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 16:59:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:16,042 INFO L225 Difference]: With dead ends: 174 [2019-11-28 16:59:16,042 INFO L226 Difference]: Without dead ends: 108 [2019-11-28 16:59:16,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-28 16:59:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-11-28 16:59:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 16:59:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-11-28 16:59:16,066 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2019-11-28 16:59:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:16,067 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-11-28 16:59:16,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-11-28 16:59:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 16:59:16,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:16,070 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:16,070 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:16,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:16,071 INFO L82 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2019-11-28 16:59:16,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:16,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610741893] [2019-11-28 16:59:16,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 16:59:16,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610741893] [2019-11-28 16:59:16,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:16,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:16,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225022984] [2019-11-28 16:59:16,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:16,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:16,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:16,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:16,143 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 3 states. [2019-11-28 16:59:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:16,189 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2019-11-28 16:59:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:16,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 16:59:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:16,191 INFO L225 Difference]: With dead ends: 201 [2019-11-28 16:59:16,191 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 16:59:16,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 16:59:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2019-11-28 16:59:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 16:59:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-11-28 16:59:16,201 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2019-11-28 16:59:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:16,202 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-11-28 16:59:16,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-11-28 16:59:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 16:59:16,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:16,204 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:16,204 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:16,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2019-11-28 16:59:16,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:16,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207781523] [2019-11-28 16:59:16,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:16,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207781523] [2019-11-28 16:59:16,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391045345] [2019-11-28 16:59:16,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:16,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 16:59:16,506 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:16,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 16:59:16,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:16,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:16,522 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:16,523 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:59:16,556 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:16,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 16:59:16,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:16,599 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-28 16:59:16,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 16:59:16,606 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:16,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:16,621 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:16,622 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-11-28 16:59:16,666 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:59:16,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-28 16:59:16,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:16,685 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:16,685 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:16,686 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2019-11-28 16:59:16,721 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:16,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-28 16:59:16,723 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:16,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:16,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:16,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 100 [2019-11-28 16:59:16,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:16,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:16,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:16,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:16,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:16,841 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:16,912 INFO L614 ElimStorePlain]: treesize reduction 209, result has 18.4 percent of original size [2019-11-28 16:59:16,913 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:16,913 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:47 [2019-11-28 16:59:17,086 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 16:59:17,087 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-28 16:59:17,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 142 [2019-11-28 16:59:17,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:17,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:17,094 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:17,132 INFO L614 ElimStorePlain]: treesize reduction 116, result has 34.1 percent of original size [2019-11-28 16:59:17,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:17,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2019-11-28 16:59:17,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:17,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 65 [2019-11-28 16:59:17,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:17,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:17,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:17,229 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:17,258 INFO L614 ElimStorePlain]: treesize reduction 9, result has 50.0 percent of original size [2019-11-28 16:59:17,258 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:17,259 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2019-11-28 16:59:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:17,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:17,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-28 16:59:17,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477006650] [2019-11-28 16:59:17,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 16:59:17,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:17,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 16:59:17,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 16:59:17,270 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 12 states. [2019-11-28 16:59:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:17,805 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2019-11-28 16:59:17,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 16:59:17,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-28 16:59:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:17,807 INFO L225 Difference]: With dead ends: 170 [2019-11-28 16:59:17,807 INFO L226 Difference]: Without dead ends: 168 [2019-11-28 16:59:17,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:59:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-28 16:59:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2019-11-28 16:59:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 16:59:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2019-11-28 16:59:17,817 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2019-11-28 16:59:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:17,817 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2019-11-28 16:59:17,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 16:59:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2019-11-28 16:59:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 16:59:17,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:17,819 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:18,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:18,024 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:18,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1259768676, now seen corresponding path program 1 times [2019-11-28 16:59:18,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:18,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084740858] [2019-11-28 16:59:18,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:59:18,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084740858] [2019-11-28 16:59:18,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:18,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:18,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854621187] [2019-11-28 16:59:18,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:18,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:18,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:18,066 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 3 states. [2019-11-28 16:59:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:18,080 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2019-11-28 16:59:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:18,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 16:59:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:18,082 INFO L225 Difference]: With dead ends: 129 [2019-11-28 16:59:18,082 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 16:59:18,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 16:59:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-28 16:59:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 16:59:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2019-11-28 16:59:18,089 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 29 [2019-11-28 16:59:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:18,090 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2019-11-28 16:59:18,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2019-11-28 16:59:18,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 16:59:18,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:18,095 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:18,096 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:18,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1259766754, now seen corresponding path program 1 times [2019-11-28 16:59:18,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:18,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997419115] [2019-11-28 16:59:18,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:18,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997419115] [2019-11-28 16:59:18,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561799099] [2019-11-28 16:59:18,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:18,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-28 16:59:18,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:18,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 16:59:18,520 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,538 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:18,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:59:18,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:18,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:59:18,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,600 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:18,607 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:18,608 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:18,625 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:18,625 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,637 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:18,637 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,638 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-28 16:59:18,671 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_17|], 4=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_30|]} [2019-11-28 16:59:18,677 INFO L377 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 19 treesize of output 11 [2019-11-28 16:59:18,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:18,700 INFO L377 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 46 treesize of output 25 [2019-11-28 16:59:18,701 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,715 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:18,743 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:18,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 90 [2019-11-28 16:59:18,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:18,745 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,772 INFO L614 ElimStorePlain]: treesize reduction 56, result has 46.7 percent of original size [2019-11-28 16:59:18,773 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,773 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:111, output treesize:49 [2019-11-28 16:59:18,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:18,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2019-11-28 16:59:18,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,837 INFO L614 ElimStorePlain]: treesize reduction 12, result has 73.3 percent of original size [2019-11-28 16:59:18,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 16:59:18,841 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,846 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:18,847 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:18,847 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2019-11-28 16:59:18,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:18,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:18,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2019-11-28 16:59:18,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660466801] [2019-11-28 16:59:18,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 16:59:18,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:18,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 16:59:18,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:59:18,884 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand 14 states. [2019-11-28 16:59:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:19,598 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2019-11-28 16:59:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:59:19,599 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-28 16:59:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:19,600 INFO L225 Difference]: With dead ends: 163 [2019-11-28 16:59:19,601 INFO L226 Difference]: Without dead ends: 161 [2019-11-28 16:59:19,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-11-28 16:59:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-28 16:59:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 136. [2019-11-28 16:59:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 16:59:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2019-11-28 16:59:19,611 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2019-11-28 16:59:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:19,611 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2019-11-28 16:59:19,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 16:59:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2019-11-28 16:59:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 16:59:19,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:19,612 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:19,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:19,817 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:19,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1992708989, now seen corresponding path program 1 times [2019-11-28 16:59:19,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:19,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405478263] [2019-11-28 16:59:19,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:20,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405478263] [2019-11-28 16:59:20,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004300740] [2019-11-28 16:59:20,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:20,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-28 16:59:20,064 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:20,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 16:59:20,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:59:20,144 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 16:59:20,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,200 INFO L614 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-28 16:59:20,205 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:20,206 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,235 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:20,235 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,252 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,253 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-28 16:59:20,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:20,298 INFO L377 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 34 treesize of output 21 [2019-11-28 16:59:20,298 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:20,332 INFO L377 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 34 treesize of output 21 [2019-11-28 16:59:20,333 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,348 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,348 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-28 16:59:20,373 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-28 16:59:20,375 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,407 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,414 INFO L377 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 62 treesize of output 32 [2019-11-28 16:59:20,414 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,438 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,483 INFO L377 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 103 [2019-11-28 16:59:20,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,485 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,540 INFO L614 ElimStorePlain]: treesize reduction 76, result has 47.2 percent of original size [2019-11-28 16:59:20,541 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,541 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:147, output treesize:57 [2019-11-28 16:59:20,600 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_28|], 12=[|v_#memory_$Pointer$.base_34|]} [2019-11-28 16:59:20,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:20,607 INFO L377 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 66 treesize of output 29 [2019-11-28 16:59:20,608 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,628 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,729 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-28 16:59:20,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 149 [2019-11-28 16:59:20,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:20,755 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-28 16:59:20,868 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2019-11-28 16:59:20,868 INFO L614 ElimStorePlain]: treesize reduction 1591, result has 5.1 percent of original size [2019-11-28 16:59:20,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:20,869 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:172, output treesize:86 [2019-11-28 16:59:20,944 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-28 16:59:20,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 38 treesize of output 18 [2019-11-28 16:59:20,948 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:20,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2019-11-28 16:59:20,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:20,983 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,996 INFO L614 ElimStorePlain]: treesize reduction 30, result has 23.1 percent of original size [2019-11-28 16:59:20,996 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:20,996 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:101, output treesize:4 [2019-11-28 16:59:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:21,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:21,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-28 16:59:21,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080379278] [2019-11-28 16:59:21,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 16:59:21,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:21,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 16:59:21,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 16:59:21,009 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand 12 states. [2019-11-28 16:59:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:21,580 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2019-11-28 16:59:21,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:59:21,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-28 16:59:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:21,582 INFO L225 Difference]: With dead ends: 169 [2019-11-28 16:59:21,582 INFO L226 Difference]: Without dead ends: 167 [2019-11-28 16:59:21,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:59:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-28 16:59:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2019-11-28 16:59:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-28 16:59:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2019-11-28 16:59:21,591 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 31 [2019-11-28 16:59:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:21,591 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2019-11-28 16:59:21,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 16:59:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2019-11-28 16:59:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 16:59:21,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:21,592 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:21,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:21,797 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:21,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:21,798 INFO L82 PathProgramCache]: Analyzing trace with hash 509365297, now seen corresponding path program 1 times [2019-11-28 16:59:21,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:21,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9167622] [2019-11-28 16:59:21,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 16:59:21,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9167622] [2019-11-28 16:59:21,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:21,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:21,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865482178] [2019-11-28 16:59:21,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:21,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:21,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:21,841 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand 3 states. [2019-11-28 16:59:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:21,878 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2019-11-28 16:59:21,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:21,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 16:59:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:21,879 INFO L225 Difference]: With dead ends: 204 [2019-11-28 16:59:21,879 INFO L226 Difference]: Without dead ends: 111 [2019-11-28 16:59:21,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-28 16:59:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2019-11-28 16:59:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 16:59:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2019-11-28 16:59:21,887 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2019-11-28 16:59:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:21,887 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2019-11-28 16:59:21,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2019-11-28 16:59:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 16:59:21,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:21,888 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:21,888 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash 525270376, now seen corresponding path program 1 times [2019-11-28 16:59:21,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:21,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599753829] [2019-11-28 16:59:21,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:21,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599753829] [2019-11-28 16:59:21,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:21,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:59:21,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823900109] [2019-11-28 16:59:21,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:59:21,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:21,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:59:21,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:59:21,938 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 4 states. [2019-11-28 16:59:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:21,978 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-11-28 16:59:21,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:59:21,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-28 16:59:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:21,979 INFO L225 Difference]: With dead ends: 118 [2019-11-28 16:59:21,980 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 16:59:21,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:59:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 16:59:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-28 16:59:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 16:59:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-11-28 16:59:21,987 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 37 [2019-11-28 16:59:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:21,987 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-11-28 16:59:21,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:59:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-11-28 16:59:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 16:59:21,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:21,988 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:21,989 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:21,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1226334954, now seen corresponding path program 1 times [2019-11-28 16:59:21,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:21,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075306346] [2019-11-28 16:59:21,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:22,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075306346] [2019-11-28 16:59:22,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509586847] [2019-11-28 16:59:22,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:22,196 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-28 16:59:22,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:22,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 16:59:22,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:22,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:22,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:22,210 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:59:22,228 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:22,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:59:22,229 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:22,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:22,262 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:22,263 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:22,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:22,281 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:22,282 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:22,294 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:22,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:22,295 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-28 16:59:22,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:22,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 98 [2019-11-28 16:59:22,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:22,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:22,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:22,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-28 16:59:22,406 INFO L614 ElimStorePlain]: treesize reduction 221, result has 22.7 percent of original size [2019-11-28 16:59:22,409 INFO L377 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 46 treesize of output 25 [2019-11-28 16:59:22,410 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:22,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:22,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:22,419 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-11-28 16:59:22,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:22,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2019-11-28 16:59:22,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:22,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:22,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:22,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:22,504 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:22,533 INFO L614 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-11-28 16:59:22,543 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:22,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 16:59:22,544 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:22,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:22,553 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:22,553 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2019-11-28 16:59:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:22,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:22,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-11-28 16:59:22,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782757574] [2019-11-28 16:59:22,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 16:59:22,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:22,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 16:59:22,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:59:22,565 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 14 states. [2019-11-28 16:59:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:22,951 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-11-28 16:59:22,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 16:59:22,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-11-28 16:59:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:22,952 INFO L225 Difference]: With dead ends: 111 [2019-11-28 16:59:22,953 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 16:59:22,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-28 16:59:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 16:59:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 16:59:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 16:59:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-11-28 16:59:22,958 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 37 [2019-11-28 16:59:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:22,958 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-11-28 16:59:22,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 16:59:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-11-28 16:59:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 16:59:22,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:22,959 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:23,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:23,170 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:23,171 INFO L82 PathProgramCache]: Analyzing trace with hash 778254669, now seen corresponding path program 1 times [2019-11-28 16:59:23,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:23,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106612314] [2019-11-28 16:59:23,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:23,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106612314] [2019-11-28 16:59:23,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616982665] [2019-11-28 16:59:23,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:23,449 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 16:59:23,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:23,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 16:59:23,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:23,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:23,466 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:23,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:59:23,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:23,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 16:59:23,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:23,529 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-28 16:59:23,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 16:59:23,534 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:23,548 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:23,548 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:23,549 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-11-28 16:59:23,597 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:59:23,597 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-28 16:59:23,598 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:23,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:23,612 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:23,612 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-11-28 16:59:23,710 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:23,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-28 16:59:23,711 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:23,781 INFO L614 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-11-28 16:59:23,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:23,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 105 [2019-11-28 16:59:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:23,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:23,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:23,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:23,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:23,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:23,842 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:23,966 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-11-28 16:59:23,966 INFO L614 ElimStorePlain]: treesize reduction 902, result has 7.1 percent of original size [2019-11-28 16:59:23,967 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:23,968 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:69 [2019-11-28 16:59:24,098 INFO L343 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-11-28 16:59:24,098 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 70 [2019-11-28 16:59:24,099 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:24,149 INFO L614 ElimStorePlain]: treesize reduction 34, result has 66.0 percent of original size [2019-11-28 16:59:24,150 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:24,150 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:66 [2019-11-28 16:59:24,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:24,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-28 16:59:24,187 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:24,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:24,385 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-28 16:59:24,385 INFO L343 Elim1Store]: treesize reduction 23, result has 85.6 percent of original size [2019-11-28 16:59:24,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 139 treesize of output 177 [2019-11-28 16:59:24,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,434 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:24,579 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2019-11-28 16:59:24,580 INFO L614 ElimStorePlain]: treesize reduction 3972, result has 2.2 percent of original size [2019-11-28 16:59:24,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:24,581 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:151, output treesize:91 [2019-11-28 16:59:24,821 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-11-28 16:59:24,822 INFO L343 Elim1Store]: treesize reduction 62, result has 72.9 percent of original size [2019-11-28 16:59:24,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 179 treesize of output 222 [2019-11-28 16:59:24,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:24,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:24,829 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 16:59:24,930 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2019-11-28 16:59:24,931 INFO L614 ElimStorePlain]: treesize reduction 625, result has 16.6 percent of original size [2019-11-28 16:59:24,932 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:24,932 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:179, output treesize:124 [2019-11-28 16:59:25,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:25,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 116 [2019-11-28 16:59:25,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:25,024 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:25,051 INFO L614 ElimStorePlain]: treesize reduction 271, result has 3.2 percent of original size [2019-11-28 16:59:25,051 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:25,052 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2019-11-28 16:59:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:25,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:25,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-11-28 16:59:25,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229470749] [2019-11-28 16:59:25,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 16:59:25,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:25,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 16:59:25,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-28 16:59:25,070 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 17 states. [2019-11-28 16:59:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:26,007 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2019-11-28 16:59:26,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 16:59:26,007 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-11-28 16:59:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:26,008 INFO L225 Difference]: With dead ends: 149 [2019-11-28 16:59:26,008 INFO L226 Difference]: Without dead ends: 147 [2019-11-28 16:59:26,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-11-28 16:59:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-28 16:59:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 78. [2019-11-28 16:59:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 16:59:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-11-28 16:59:26,016 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2019-11-28 16:59:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:26,017 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-11-28 16:59:26,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 16:59:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-11-28 16:59:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 16:59:26,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:26,018 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:26,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:26,219 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:26,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1793269558, now seen corresponding path program 1 times [2019-11-28 16:59:26,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:26,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026769123] [2019-11-28 16:59:26,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:26,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026769123] [2019-11-28 16:59:26,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948836711] [2019-11-28 16:59:26,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:26,709 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-28 16:59:26,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:26,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 16:59:26,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:26,730 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:26,730 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:26,730 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:59:26,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:26,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 16:59:26,775 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:26,826 INFO L614 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-28 16:59:26,830 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:26,831 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:26,847 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:26,853 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:26,853 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:26,869 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:26,870 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:26,870 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-28 16:59:26,900 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_19|], 6=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_44|]} [2019-11-28 16:59:26,904 INFO L377 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 13 treesize of output 9 [2019-11-28 16:59:26,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:26,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:26,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:26,942 INFO L377 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 34 treesize of output 21 [2019-11-28 16:59:26,943 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:26,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:26,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:26,980 INFO L377 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 34 treesize of output 21 [2019-11-28 16:59:26,981 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:27,004 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:27,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:27,004 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-11-28 16:59:27,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:27,089 INFO L377 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 20 treesize of output 30 [2019-11-28 16:59:27,089 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:27,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:27,137 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_int_18|], 9=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_33|]} [2019-11-28 16:59:27,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-28 16:59:27,158 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:27,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:27,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 16:59:27,201 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:27,230 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:27,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:27,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2019-11-28 16:59:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,305 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:27,536 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-11-28 16:59:27,536 INFO L614 ElimStorePlain]: treesize reduction 1388, result has 7.4 percent of original size [2019-11-28 16:59:27,545 INFO L377 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 62 treesize of output 32 [2019-11-28 16:59:27,545 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:27,566 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:27,567 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:27,567 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:196, output treesize:64 [2019-11-28 16:59:27,611 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_21|], 6=[|v_#memory_$Pointer$.offset_34|], 12=[|v_#memory_$Pointer$.base_46|]} [2019-11-28 16:59:27,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-11-28 16:59:27,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:27,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:27,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:27,655 INFO L377 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 66 treesize of output 29 [2019-11-28 16:59:27,656 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:27,694 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:27,815 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 16:59:27,815 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-28 16:59:27,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 161 [2019-11-28 16:59:27,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:27,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:27,838 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 9 xjuncts. [2019-11-28 16:59:27,976 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-11-28 16:59:27,976 INFO L614 ElimStorePlain]: treesize reduction 1955, result has 5.0 percent of original size [2019-11-28 16:59:27,977 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:27,977 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:102 [2019-11-28 16:59:28,038 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-28 16:59:28,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 10 [2019-11-28 16:59:28,046 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:28,066 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:28,091 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:28,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 77 [2019-11-28 16:59:28,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:28,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:28,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:28,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:28,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:28,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:28,096 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:28,133 INFO L614 ElimStorePlain]: treesize reduction 36, result has 47.1 percent of original size [2019-11-28 16:59:28,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:28,134 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:24 [2019-11-28 16:59:28,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:28,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:28,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-28 16:59:28,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218878793] [2019-11-28 16:59:28,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 16:59:28,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 16:59:28,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:59:28,204 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 15 states. [2019-11-28 16:59:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:29,131 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-11-28 16:59:29,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 16:59:29,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-11-28 16:59:29,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:29,133 INFO L225 Difference]: With dead ends: 101 [2019-11-28 16:59:29,133 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 16:59:29,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-11-28 16:59:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 16:59:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2019-11-28 16:59:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 16:59:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2019-11-28 16:59:29,141 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 40 [2019-11-28 16:59:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:29,141 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2019-11-28 16:59:29,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 16:59:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2019-11-28 16:59:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 16:59:29,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:29,142 INFO L410 BasicCegarLoop]: trace histogram [4, 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] [2019-11-28 16:59:29,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:29,349 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:29,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:29,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1428751921, now seen corresponding path program 1 times [2019-11-28 16:59:29,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:29,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3818853] [2019-11-28 16:59:29,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 16:59:29,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3818853] [2019-11-28 16:59:29,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:29,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:29,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799214428] [2019-11-28 16:59:29,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:29,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:29,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:29,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:29,380 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 3 states. [2019-11-28 16:59:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:29,414 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-11-28 16:59:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:29,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 16:59:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:29,415 INFO L225 Difference]: With dead ends: 110 [2019-11-28 16:59:29,415 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 16:59:29,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 16:59:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2019-11-28 16:59:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 16:59:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-11-28 16:59:29,423 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 41 [2019-11-28 16:59:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:29,424 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-11-28 16:59:29,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-11-28 16:59:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 16:59:29,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:29,425 INFO L410 BasicCegarLoop]: trace histogram [4, 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] [2019-11-28 16:59:29,428 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:29,428 INFO L82 PathProgramCache]: Analyzing trace with hash 755507507, now seen corresponding path program 1 times [2019-11-28 16:59:29,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:29,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338639180] [2019-11-28 16:59:29,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:29,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338639180] [2019-11-28 16:59:29,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959214863] [2019-11-28 16:59:29,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:29,835 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-28 16:59:29,837 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:29,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 16:59:29,848 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:29,854 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:29,855 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:29,855 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:59:29,885 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:29,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 16:59:29,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:29,935 INFO L614 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-28 16:59:29,941 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:29,942 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:29,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:29,963 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:29,963 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:29,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:29,978 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:29,978 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-28 16:59:30,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:30,021 INFO L377 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 34 treesize of output 21 [2019-11-28 16:59:30,022 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,046 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:30,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:30,052 INFO L377 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 34 treesize of output 21 [2019-11-28 16:59:30,053 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:30,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,078 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-28 16:59:30,165 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:30,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-28 16:59:30,166 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,279 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-28 16:59:30,279 INFO L614 ElimStorePlain]: treesize reduction 40, result has 80.2 percent of original size [2019-11-28 16:59:30,286 INFO L377 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 62 treesize of output 32 [2019-11-28 16:59:30,287 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:30,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:30,376 INFO L377 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 108 [2019-11-28 16:59:30,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:30,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:30,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:30,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:30,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:30,381 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,509 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-28 16:59:30,510 INFO L614 ElimStorePlain]: treesize reduction 481, result has 15.8 percent of original size [2019-11-28 16:59:30,510 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,511 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:156, output treesize:79 [2019-11-28 16:59:30,614 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_38|], 12=[|v_#memory_$Pointer$.base_50|]} [2019-11-28 16:59:30,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:30,621 INFO L377 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 34 treesize of output 21 [2019-11-28 16:59:30,621 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:30,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:30,710 INFO L343 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-28 16:59:30,711 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 78 [2019-11-28 16:59:30,712 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,792 INFO L614 ElimStorePlain]: treesize reduction 50, result has 60.3 percent of original size [2019-11-28 16:59:30,793 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,793 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:76 [2019-11-28 16:59:30,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:30,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-28 16:59:30,867 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:30,933 INFO L430 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_39|], 18=[|v_#memory_$Pointer$.base_51|]} [2019-11-28 16:59:30,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 36 [2019-11-28 16:59:30,939 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:30,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:31,180 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-28 16:59:31,181 INFO L343 Elim1Store]: treesize reduction 23, result has 85.6 percent of original size [2019-11-28 16:59:31,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 158 treesize of output 184 [2019-11-28 16:59:31,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:31,416 INFO L534 ElimStorePlain]: Start of recursive call 4: 21 dim-0 vars, End of recursive call: 21 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:32,291 WARN L192 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 577 DAG size of output: 44 [2019-11-28 16:59:32,292 INFO L614 ElimStorePlain]: treesize reduction 18185, result has 0.7 percent of original size [2019-11-28 16:59:32,293 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:32,293 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:236, output treesize:109 [2019-11-28 16:59:32,386 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_40|], 20=[|v_#memory_$Pointer$.base_52|]} [2019-11-28 16:59:32,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:32,393 INFO L377 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 82 treesize of output 33 [2019-11-28 16:59:32,393 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:32,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:32,645 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-11-28 16:59:32,645 INFO L343 Elim1Store]: treesize reduction 62, result has 72.9 percent of original size [2019-11-28 16:59:32,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 229 [2019-11-28 16:59:32,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:32,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:32,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:32,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:32,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:32,657 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2019-11-28 16:59:32,821 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-11-28 16:59:32,821 INFO L614 ElimStorePlain]: treesize reduction 3649, result has 4.0 percent of original size [2019-11-28 16:59:32,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:32,823 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:264, output treesize:154 [2019-11-28 16:59:32,899 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2019-11-28 16:59:32,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 18 [2019-11-28 16:59:32,904 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:32,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:32,984 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:32,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 116 [2019-11-28 16:59:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:32,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:33,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:33,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:33,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:33,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:33,004 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:33,021 INFO L614 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-11-28 16:59:33,022 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:33,022 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:169, output treesize:4 [2019-11-28 16:59:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:33,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:33,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-11-28 16:59:33,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084910378] [2019-11-28 16:59:33,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 16:59:33,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:33,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 16:59:33,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-11-28 16:59:33,069 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 20 states. [2019-11-28 16:59:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:34,213 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-28 16:59:34,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 16:59:34,221 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-11-28 16:59:34,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:34,222 INFO L225 Difference]: With dead ends: 131 [2019-11-28 16:59:34,222 INFO L226 Difference]: Without dead ends: 129 [2019-11-28 16:59:34,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2019-11-28 16:59:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-28 16:59:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2019-11-28 16:59:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 16:59:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-11-28 16:59:34,229 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 41 [2019-11-28 16:59:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:34,229 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-11-28 16:59:34,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 16:59:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-11-28 16:59:34,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 16:59:34,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:34,230 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1] [2019-11-28 16:59:34,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:34,436 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:34,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1699655007, now seen corresponding path program 1 times [2019-11-28 16:59:34,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:34,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829123524] [2019-11-28 16:59:34,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:34,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829123524] [2019-11-28 16:59:34,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926982826] [2019-11-28 16:59:34,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:34,842 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-28 16:59:34,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:34,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 16:59:34,854 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:34,874 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:34,874 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:34,875 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:59:34,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:34,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 16:59:34,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:34,961 INFO L614 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-28 16:59:34,967 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:34,967 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:34,982 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:34,985 INFO L377 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 27 treesize of output 15 [2019-11-28 16:59:34,986 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:35,002 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,002 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-28 16:59:35,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:35,044 INFO L377 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 34 treesize of output 21 [2019-11-28 16:59:35,045 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,065 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:35,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:35,069 INFO L377 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 34 treesize of output 21 [2019-11-28 16:59:35,070 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:35,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,088 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-28 16:59:35,145 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:35,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-28 16:59:35,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,271 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-28 16:59:35,271 INFO L614 ElimStorePlain]: treesize reduction 40, result has 79.8 percent of original size [2019-11-28 16:59:35,278 INFO L377 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 62 treesize of output 32 [2019-11-28 16:59:35,279 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:35,360 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:35,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 100 [2019-11-28 16:59:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,367 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,459 INFO L614 ElimStorePlain]: treesize reduction 256, result has 25.1 percent of original size [2019-11-28 16:59:35,460 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,460 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:152, output treesize:86 [2019-11-28 16:59:35,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:35,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:35,553 INFO L377 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 71 [2019-11-28 16:59:35,555 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,641 INFO L614 ElimStorePlain]: treesize reduction 52, result has 66.9 percent of original size [2019-11-28 16:59:35,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:35,647 INFO L377 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 45 treesize of output 35 [2019-11-28 16:59:35,648 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,679 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:35,680 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,680 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:86 [2019-11-28 16:59:35,715 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:35,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-28 16:59:35,716 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:35,767 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:35,934 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-28 16:59:35,935 INFO L343 Elim1Store]: treesize reduction 19, result has 87.2 percent of original size [2019-11-28 16:59:35,936 INFO L377 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 216 treesize of output 206 [2019-11-28 16:59:35,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:35,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:35,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,014 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:36,134 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-11-28 16:59:36,134 INFO L614 ElimStorePlain]: treesize reduction 111, result has 47.6 percent of original size [2019-11-28 16:59:36,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:36,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2019-11-28 16:59:36,144 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:36,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:36,181 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:36,181 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:239, output treesize:96 [2019-11-28 16:59:36,233 INFO L430 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_46|], 19=[|v_#memory_$Pointer$.base_58|]} [2019-11-28 16:59:36,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:36,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 47 [2019-11-28 16:59:36,238 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:36,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:36,461 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-11-28 16:59:36,462 INFO L343 Elim1Store]: treesize reduction 62, result has 72.4 percent of original size [2019-11-28 16:59:36,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 201 treesize of output 228 [2019-11-28 16:59:36,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,482 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-28 16:59:36,665 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-11-28 16:59:36,666 INFO L614 ElimStorePlain]: treesize reduction 3627, result has 4.0 percent of original size [2019-11-28 16:59:36,667 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:36,667 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:263, output treesize:153 [2019-11-28 16:59:36,748 INFO L430 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 29=[|#memory_$Pointer$.base|]} [2019-11-28 16:59:36,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:36,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2019-11-28 16:59:36,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:36,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:36,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:36,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 108 [2019-11-28 16:59:36,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:36,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:36,829 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:36,850 INFO L614 ElimStorePlain]: treesize reduction 261, result has 3.3 percent of original size [2019-11-28 16:59:36,851 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:36,851 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:184, output treesize:4 [2019-11-28 16:59:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:36,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:36,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2019-11-28 16:59:36,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247071275] [2019-11-28 16:59:36,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 16:59:36,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:36,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 16:59:36,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:59:36,886 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 16 states. [2019-11-28 16:59:37,234 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-28 16:59:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:37,940 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-11-28 16:59:37,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 16:59:37,941 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-11-28 16:59:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:37,943 INFO L225 Difference]: With dead ends: 129 [2019-11-28 16:59:37,943 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 16:59:37,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-11-28 16:59:37,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 16:59:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2019-11-28 16:59:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 16:59:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2019-11-28 16:59:37,956 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 44 [2019-11-28 16:59:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:37,957 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2019-11-28 16:59:37,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 16:59:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2019-11-28 16:59:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 16:59:37,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:37,959 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:38,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:38,172 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:38,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1057023877, now seen corresponding path program 1 times [2019-11-28 16:59:38,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:38,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608785369] [2019-11-28 16:59:38,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:59:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:59:38,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:59:38,304 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:59:38,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:59:38 BoogieIcfgContainer [2019-11-28 16:59:38,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:59:38,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:59:38,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:59:38,384 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:59:38,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:59:13" (3/4) ... [2019-11-28 16:59:38,388 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 16:59:38,481 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:59:38,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:59:38,484 INFO L168 Benchmark]: Toolchain (without parser) took 26331.48 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 451.9 MB). Free memory was 952.3 MB in the beginning and 954.2 MB in the end (delta: -1.9 MB). Peak memory consumption was 450.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:38,485 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:59:38,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:38,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:38,486 INFO L168 Benchmark]: Boogie Preprocessor took 39.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:59:38,487 INFO L168 Benchmark]: RCFGBuilder took 650.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:38,487 INFO L168 Benchmark]: TraceAbstraction took 24814.14 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 307.2 MB). Free memory was 1.1 GB in the beginning and 966.5 MB in the end (delta: 115.5 MB). Peak memory consumption was 422.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:38,487 INFO L168 Benchmark]: Witness Printer took 97.98 ms. Allocated memory is still 1.5 GB. Free memory was 966.5 MB in the beginning and 954.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:38,494 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 658.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 650.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24814.14 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 307.2 MB). Free memory was 1.1 GB in the beginning and 966.5 MB in the end (delta: 115.5 MB). Peak memory consumption was 422.7 MB. Max. memory is 11.5 GB. * Witness Printer took 97.98 ms. Allocated memory is still 1.5 GB. Free memory was 966.5 MB in the beginning and 954.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1035]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L988] SLL* item = head; [L989] int status = 0; [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND TRUE !status [L999] item->data = 1 [L1000] status = 1 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND FALSE !(!status) [L1002] COND TRUE status == 1 [L1004] item->data = 2 [L1005] status = 2 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND FALSE !(!status) [L1002] COND FALSE !(status == 1) [L1007] COND TRUE status >= 2 [L1009] item->data = 3 [L1010] status = 3 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) [L1018] COND FALSE !(status == 1) [L1023] COND FALSE !(status == 2) [L1029] COND TRUE status == 3 [L1031] COND FALSE !(!(head != ((void*)0))) [L1032] EXPR head->next [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1033] EXPR head->next [L1033] EXPR head->next->next [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1034] EXPR head->next [L1034] EXPR head->next->next [L1034] EXPR head->next->next->next [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1035] EXPR head->next [L1035] EXPR head->next->next [L1035] EXPR head->next->next->next [L1035] EXPR head->next->next->next->data [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 14 error locations. Result: UNSAFE, OverallTime: 24.6s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1403 SDtfs, 1526 SDslu, 4780 SDs, 0 SdLazy, 2816 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 298 SyntacticMatches, 13 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 360 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 824 ConstructedInterpolants, 141 QuantifiedInterpolants, 982205 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1117 ConjunctsInSsa, 329 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 87/337 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...