./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.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-circular-1.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 550de44c598358d86c5215062b141ca9f9605e9c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.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-circular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 550de44c598358d86c5215062b141ca9f9605e9c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:46:08,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:46:08,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:46:08,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:46:08,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:46:08,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:46:08,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:46:08,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:46:08,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:46:08,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:46:08,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:46:08,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:46:08,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:46:08,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:46:08,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:46:08,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:46:08,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:46:08,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:46:08,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:46:08,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:46:08,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:46:08,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:46:08,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:46:08,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:46:08,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:46:08,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:46:08,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:46:08,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:46:08,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:46:08,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:46:08,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:46:08,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:46:08,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:46:08,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:46:08,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:46:08,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:46:08,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:46:08,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:46:08,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:46:08,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:46:08,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:46:08,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 00:46:08,645 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:46:08,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:46:08,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:46:08,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:46:08,650 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:46:08,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:46:08,651 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:46:08,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 00:46:08,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:46:08,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:46:08,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:46:08,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:46:08,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:46:08,653 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:46:08,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:46:08,654 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:46:08,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:46:08,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:46:08,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:46:08,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:46:08,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:46:08,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:46:08,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:46:08,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:46:08,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:46:08,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 00:46:08,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 00:46:08,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:46:08,656 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:46:08,656 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 550de44c598358d86c5215062b141ca9f9605e9c [2020-10-20 00:46:08,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:46:08,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:46:08,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:46:08,878 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:46:08,879 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:46:08,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2020-10-20 00:46:08,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba523d667/8b9ea10d765d4bf0bd3489b538c107cf/FLAGc5e5fb8f9 [2020-10-20 00:46:09,551 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:46:09,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2020-10-20 00:46:09,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba523d667/8b9ea10d765d4bf0bd3489b538c107cf/FLAGc5e5fb8f9 [2020-10-20 00:46:09,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba523d667/8b9ea10d765d4bf0bd3489b538c107cf [2020-10-20 00:46:09,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:46:09,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:46:09,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:46:09,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:46:09,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:46:09,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:46:09" (1/1) ... [2020-10-20 00:46:09,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac9f974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:09, skipping insertion in model container [2020-10-20 00:46:09,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:46:09" (1/1) ... [2020-10-20 00:46:09,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:46:09,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:46:10,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:46:10,195 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:46:10,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:46:10,304 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:46:10,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10 WrapperNode [2020-10-20 00:46:10,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:46:10,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:46:10,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:46:10,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:46:10,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (1/1) ... [2020-10-20 00:46:10,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (1/1) ... [2020-10-20 00:46:10,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:46:10,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:46:10,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:46:10,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:46:10,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (1/1) ... [2020-10-20 00:46:10,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (1/1) ... [2020-10-20 00:46:10,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (1/1) ... [2020-10-20 00:46:10,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (1/1) ... [2020-10-20 00:46:10,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (1/1) ... [2020-10-20 00:46:10,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (1/1) ... [2020-10-20 00:46:10,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (1/1) ... [2020-10-20 00:46:10,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:46:10,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:46:10,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:46:10,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:46:10,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (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 [2020-10-20 00:46:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 00:46:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 00:46:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 00:46:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 00:46:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:46:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 00:46:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:46:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 00:46:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:46:10,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:46:10,893 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:46:10,894 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-20 00:46:10,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:10 BoogieIcfgContainer [2020-10-20 00:46:10,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:46:10,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:46:10,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:46:10,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:46:10,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:46:09" (1/3) ... [2020-10-20 00:46:10,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289fd046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:46:10, skipping insertion in model container [2020-10-20 00:46:10,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:10" (2/3) ... [2020-10-20 00:46:10,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289fd046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:46:10, skipping insertion in model container [2020-10-20 00:46:10,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:10" (3/3) ... [2020-10-20 00:46:10,918 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2020-10-20 00:46:10,929 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:46:10,935 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-10-20 00:46:10,949 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-10-20 00:46:10,976 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:46:10,976 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:46:10,976 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:46:10,976 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:46:10,977 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:46:10,977 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:46:10,977 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:46:10,977 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:46:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-10-20 00:46:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-20 00:46:10,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:10,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:10,999 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:11,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:11,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1854531709, now seen corresponding path program 1 times [2020-10-20 00:46:11,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:11,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25296764] [2020-10-20 00:46:11,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:11,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25296764] [2020-10-20 00:46:11,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:11,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 00:46:11,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288002023] [2020-10-20 00:46:11,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 00:46:11,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:11,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 00:46:11,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:46:11,241 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2020-10-20 00:46:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:11,262 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2020-10-20 00:46:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 00:46:11,264 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-10-20 00:46:11,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:11,274 INFO L225 Difference]: With dead ends: 73 [2020-10-20 00:46:11,275 INFO L226 Difference]: Without dead ends: 29 [2020-10-20 00:46:11,278 INFO L677 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 [2020-10-20 00:46:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-20 00:46:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-20 00:46:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 00:46:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2020-10-20 00:46:11,330 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 7 [2020-10-20 00:46:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:11,330 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2020-10-20 00:46:11,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 00:46:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2020-10-20 00:46:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-20 00:46:11,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:11,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:11,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 00:46:11,333 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:11,333 INFO L82 PathProgramCache]: Analyzing trace with hash 179014541, now seen corresponding path program 1 times [2020-10-20 00:46:11,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:11,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636991798] [2020-10-20 00:46:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:11,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636991798] [2020-10-20 00:46:11,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:11,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:46:11,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302813286] [2020-10-20 00:46:11,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:46:11,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:11,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:46:11,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:46:11,496 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 4 states. [2020-10-20 00:46:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:11,577 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2020-10-20 00:46:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:46:11,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-20 00:46:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:11,579 INFO L225 Difference]: With dead ends: 47 [2020-10-20 00:46:11,579 INFO L226 Difference]: Without dead ends: 41 [2020-10-20 00:46:11,581 INFO L677 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 [2020-10-20 00:46:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-20 00:46:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2020-10-20 00:46:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-20 00:46:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-10-20 00:46:11,588 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 8 [2020-10-20 00:46:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:11,589 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-10-20 00:46:11,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:46:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-10-20 00:46:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 00:46:11,590 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:11,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:11,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 00:46:11,591 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash 432810643, now seen corresponding path program 1 times [2020-10-20 00:46:11,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:11,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638796350] [2020-10-20 00:46:11,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:11,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638796350] [2020-10-20 00:46:11,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:11,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:11,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844509872] [2020-10-20 00:46:11,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:11,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:11,672 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2020-10-20 00:46:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:11,699 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2020-10-20 00:46:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:11,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-20 00:46:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:11,703 INFO L225 Difference]: With dead ends: 77 [2020-10-20 00:46:11,703 INFO L226 Difference]: Without dead ends: 53 [2020-10-20 00:46:11,704 INFO L677 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 [2020-10-20 00:46:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-20 00:46:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2020-10-20 00:46:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-20 00:46:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2020-10-20 00:46:11,713 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 11 [2020-10-20 00:46:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:11,714 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-10-20 00:46:11,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-10-20 00:46:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 00:46:11,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:11,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:11,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 00:46:11,716 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:11,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash -660271766, now seen corresponding path program 1 times [2020-10-20 00:46:11,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:11,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521636034] [2020-10-20 00:46:11,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:11,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521636034] [2020-10-20 00:46:11,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:11,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:11,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141321641] [2020-10-20 00:46:11,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:11,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:11,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:11,758 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 3 states. [2020-10-20 00:46:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:11,775 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-10-20 00:46:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:11,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-20 00:46:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:11,777 INFO L225 Difference]: With dead ends: 41 [2020-10-20 00:46:11,777 INFO L226 Difference]: Without dead ends: 38 [2020-10-20 00:46:11,777 INFO L677 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 [2020-10-20 00:46:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-20 00:46:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-10-20 00:46:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-20 00:46:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-10-20 00:46:11,784 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 14 [2020-10-20 00:46:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:11,785 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-10-20 00:46:11,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-10-20 00:46:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 00:46:11,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:11,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:11,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 00:46:11,787 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:11,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:11,788 INFO L82 PathProgramCache]: Analyzing trace with hash -660212184, now seen corresponding path program 1 times [2020-10-20 00:46:11,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:11,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007489374] [2020-10-20 00:46:11,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:11,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007489374] [2020-10-20 00:46:11,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:11,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:46:11,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085099528] [2020-10-20 00:46:11,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:46:11,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:11,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:46:11,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:46:11,996 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2020-10-20 00:46:12,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:12,184 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2020-10-20 00:46:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:46:12,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 00:46:12,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:12,186 INFO L225 Difference]: With dead ends: 50 [2020-10-20 00:46:12,186 INFO L226 Difference]: Without dead ends: 36 [2020-10-20 00:46:12,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:46:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-20 00:46:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-20 00:46:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 00:46:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-10-20 00:46:12,193 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 14 [2020-10-20 00:46:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:12,193 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-10-20 00:46:12,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:46:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-10-20 00:46:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 00:46:12,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:12,195 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:12,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 00:46:12,195 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash 676491352, now seen corresponding path program 1 times [2020-10-20 00:46:12,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:12,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780759001] [2020-10-20 00:46:12,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:12,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780759001] [2020-10-20 00:46:12,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320002708] [2020-10-20 00:46:12,266 INFO L95 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 [2020-10-20 00:46:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:12,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-20 00:46:12,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:12,437 INFO L384 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 [2020-10-20 00:46:12,438 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:12,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:12,447 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:12,447 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 00:46:12,479 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:12,480 INFO L384 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 [2020-10-20 00:46:12,481 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:12,490 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:12,497 INFO L384 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 [2020-10-20 00:46:12,497 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:12,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:12,507 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:12,507 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2020-10-20 00:46:12,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:12,534 INFO L384 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 [2020-10-20 00:46:12,536 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:12,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:12,546 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:12,546 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-10-20 00:46:12,611 INFO L441 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|v_#memory_$Pointer$.base_18|]} [2020-10-20 00:46:12,617 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:12,628 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:12,640 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:12,640 INFO L384 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 64 treesize of output 51 [2020-10-20 00:46:12,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-20 00:46:12,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 00:46:12,654 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:12,664 INFO L625 ElimStorePlain]: treesize reduction 9, result has 50.0 percent of original size [2020-10-20 00:46:12,667 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:12,667 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:4 [2020-10-20 00:46:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:12,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:46:12,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2020-10-20 00:46:12,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893084312] [2020-10-20 00:46:12,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 00:46:12,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:12,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 00:46:12,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:46:12,671 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 7 states. [2020-10-20 00:46:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:12,787 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-10-20 00:46:12,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:46:12,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-20 00:46:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:12,789 INFO L225 Difference]: With dead ends: 65 [2020-10-20 00:46:12,789 INFO L226 Difference]: Without dead ends: 62 [2020-10-20 00:46:12,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:46:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-20 00:46:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2020-10-20 00:46:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-20 00:46:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2020-10-20 00:46:12,796 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 14 [2020-10-20 00:46:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:12,796 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2020-10-20 00:46:12,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 00:46:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2020-10-20 00:46:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:46:12,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:12,798 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:12,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-10-20 00:46:13,000 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash -495923713, now seen corresponding path program 1 times [2020-10-20 00:46:13,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:13,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209254195] [2020-10-20 00:46:13,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:13,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209254195] [2020-10-20 00:46:13,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:13,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:13,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812355466] [2020-10-20 00:46:13,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:13,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:13,085 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 3 states. [2020-10-20 00:46:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:13,118 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2020-10-20 00:46:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:13,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-20 00:46:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:13,119 INFO L225 Difference]: With dead ends: 102 [2020-10-20 00:46:13,120 INFO L226 Difference]: Without dead ends: 77 [2020-10-20 00:46:13,121 INFO L677 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 [2020-10-20 00:46:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-20 00:46:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2020-10-20 00:46:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-20 00:46:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2020-10-20 00:46:13,128 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 18 [2020-10-20 00:46:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:13,128 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2020-10-20 00:46:13,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2020-10-20 00:46:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 00:46:13,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:13,130 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:13,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 00:46:13,130 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:13,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1591552333, now seen corresponding path program 1 times [2020-10-20 00:46:13,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:13,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059615817] [2020-10-20 00:46:13,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:13,260 ERROR L253 erpolLogProxyWrapper]: Interpolant 16 not inductive [2020-10-20 00:46:13,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 00:46:13,264 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-20 00:46:13,275 INFO L168 Benchmark]: Toolchain (without parser) took 3446.62 ms. Allocated memory was 42.5 MB in the beginning and 56.1 MB in the end (delta: 13.6 MB). Free memory was 19.7 MB in the beginning and 14.5 MB in the end (delta: 5.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:13,276 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 32.0 MB. Free memory was 9.1 MB in the beginning and 9.1 MB in the end (delta: 45.8 kB). Peak memory consumption was 45.8 kB. Max. memory is 14.3 GB. [2020-10-20 00:46:13,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.93 ms. Allocated memory was 42.5 MB in the beginning and 45.1 MB in the end (delta: 2.6 MB). Free memory was 18.8 MB in the beginning and 21.4 MB in the end (delta: -2.7 MB). Peak memory consumption was 8.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:13,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.49 ms. Allocated memory is still 45.1 MB. Free memory was 21.4 MB in the beginning and 19.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:13,283 INFO L168 Benchmark]: Boogie Preprocessor took 37.21 ms. Allocated memory is still 45.1 MB. Free memory was 19.3 MB in the beginning and 17.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:13,284 INFO L168 Benchmark]: RCFGBuilder took 501.29 ms. Allocated memory is still 45.1 MB. Free memory was 17.4 MB in the beginning and 11.2 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:13,285 INFO L168 Benchmark]: TraceAbstraction took 2366.59 ms. Allocated memory was 47.2 MB in the beginning and 56.1 MB in the end (delta: 8.9 MB). Free memory was 29.3 MB in the beginning and 14.5 MB in the end (delta: 14.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:13,295 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 32.0 MB. Free memory was 9.1 MB in the beginning and 9.1 MB in the end (delta: 45.8 kB). Peak memory consumption was 45.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 471.93 ms. Allocated memory was 42.5 MB in the beginning and 45.1 MB in the end (delta: 2.6 MB). Free memory was 18.8 MB in the beginning and 21.4 MB in the end (delta: -2.7 MB). Peak memory consumption was 8.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 51.49 ms. Allocated memory is still 45.1 MB. Free memory was 21.4 MB in the beginning and 19.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 37.21 ms. Allocated memory is still 45.1 MB. Free memory was 19.3 MB in the beginning and 17.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 501.29 ms. Allocated memory is still 45.1 MB. Free memory was 17.4 MB in the beginning and 11.2 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.8 MB. Max. memory is 14.3 GB. * TraceAbstraction took 2366.59 ms. Allocated memory was 47.2 MB in the beginning and 56.1 MB in the end (delta: 8.9 MB). Free memory was 29.3 MB in the beginning and 14.5 MB in the end (delta: 14.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:46:15,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:46:15,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:46:15,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:46:15,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:46:15,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:46:15,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:46:15,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:46:15,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:46:15,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:46:15,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:46:15,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:46:15,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:46:15,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:46:15,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:46:15,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:46:15,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:46:15,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:46:15,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:46:15,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:46:15,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:46:15,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:46:15,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:46:15,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:46:15,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:46:15,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:46:15,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:46:15,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:46:15,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:46:15,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:46:15,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:46:15,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:46:15,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:46:15,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:46:15,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:46:15,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:46:15,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:46:15,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:46:15,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:46:15,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:46:15,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:46:15,572 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-20 00:46:15,607 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:46:15,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:46:15,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:46:15,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:46:15,609 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:46:15,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:46:15,610 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:46:15,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:46:15,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:46:15,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:46:15,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:46:15,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:46:15,613 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-20 00:46:15,613 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-20 00:46:15,613 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:46:15,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:46:15,614 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:46:15,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:46:15,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:46:15,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:46:15,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:46:15,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:46:15,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:46:15,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:46:15,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:46:15,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:46:15,616 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-20 00:46:15,616 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-20 00:46:15,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:46:15,617 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:46:15,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-20 00:46:15,617 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 550de44c598358d86c5215062b141ca9f9605e9c [2020-10-20 00:46:15,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:46:15,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:46:15,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:46:15,833 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:46:15,834 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:46:15,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2020-10-20 00:46:15,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3897868f7/80455eb8d61d4be784e093e5d2a17b2b/FLAG3103fdae2 [2020-10-20 00:46:16,516 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:46:16,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2020-10-20 00:46:16,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3897868f7/80455eb8d61d4be784e093e5d2a17b2b/FLAG3103fdae2 [2020-10-20 00:46:16,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3897868f7/80455eb8d61d4be784e093e5d2a17b2b [2020-10-20 00:46:16,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:46:16,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:46:16,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:46:16,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:46:16,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:46:16,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:46:16" (1/1) ... [2020-10-20 00:46:16,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2170668e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:16, skipping insertion in model container [2020-10-20 00:46:16,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:46:16" (1/1) ... [2020-10-20 00:46:16,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:46:16,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:46:17,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:46:17,286 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:46:17,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:46:17,394 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:46:17,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17 WrapperNode [2020-10-20 00:46:17,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:46:17,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:46:17,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:46:17,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:46:17,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (1/1) ... [2020-10-20 00:46:17,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (1/1) ... [2020-10-20 00:46:17,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:46:17,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:46:17,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:46:17,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:46:17,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (1/1) ... [2020-10-20 00:46:17,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (1/1) ... [2020-10-20 00:46:17,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (1/1) ... [2020-10-20 00:46:17,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (1/1) ... [2020-10-20 00:46:17,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (1/1) ... [2020-10-20 00:46:17,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (1/1) ... [2020-10-20 00:46:17,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (1/1) ... [2020-10-20 00:46:17,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:46:17,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:46:17,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:46:17,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:46:17,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (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 [2020-10-20 00:46:17,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-20 00:46:17,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 00:46:17,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 00:46:17,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:46:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 00:46:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:46:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-10-20 00:46:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-20 00:46:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:46:17,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:46:18,018 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:46:18,019 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-20 00:46:18,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:18 BoogieIcfgContainer [2020-10-20 00:46:18,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:46:18,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:46:18,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:46:18,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:46:18,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:46:16" (1/3) ... [2020-10-20 00:46:18,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b8d0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:46:18, skipping insertion in model container [2020-10-20 00:46:18,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:17" (2/3) ... [2020-10-20 00:46:18,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b8d0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:46:18, skipping insertion in model container [2020-10-20 00:46:18,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:18" (3/3) ... [2020-10-20 00:46:18,029 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2020-10-20 00:46:18,041 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:46:18,049 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-10-20 00:46:18,060 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-10-20 00:46:18,082 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:46:18,091 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:46:18,091 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:46:18,092 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:46:18,092 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:46:18,092 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:46:18,092 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:46:18,092 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:46:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-10-20 00:46:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-20 00:46:18,112 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:18,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:18,113 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1853577404, now seen corresponding path program 1 times [2020-10-20 00:46:18,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:46:18,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635190919] [2020-10-20 00:46:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-20 00:46:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:18,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-20 00:46:18,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:18,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:46:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:18,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635190919] [2020-10-20 00:46:18,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:18,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-20 00:46:18,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883527198] [2020-10-20 00:46:18,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 00:46:18,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:46:18,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 00:46:18,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:46:18,284 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2020-10-20 00:46:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:18,305 INFO L93 Difference]: Finished difference Result 71 states and 113 transitions. [2020-10-20 00:46:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 00:46:18,306 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-10-20 00:46:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:18,317 INFO L225 Difference]: With dead ends: 71 [2020-10-20 00:46:18,317 INFO L226 Difference]: Without dead ends: 28 [2020-10-20 00:46:18,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:46:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-10-20 00:46:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-10-20 00:46:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 00:46:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-10-20 00:46:18,364 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 7 [2020-10-20 00:46:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:18,364 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-20 00:46:18,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 00:46:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-10-20 00:46:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-20 00:46:18,365 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:18,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:18,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-20 00:46:18,578 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1810171917, now seen corresponding path program 1 times [2020-10-20 00:46:18,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:46:18,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950182493] [2020-10-20 00:46:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-20 00:46:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:18,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 00:46:18,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:18,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:18,761 INFO L384 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 22 treesize of output 7 [2020-10-20 00:46:18,762 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:18,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:18,785 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:18,786 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2020-10-20 00:46:18,855 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-20 00:46:18,857 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:18,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:18,898 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-20 00:46:18,899 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:18,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:18,910 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:18,911 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:4 [2020-10-20 00:46:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:18,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:46:18,953 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:18,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:18,962 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:18,964 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2020-10-20 00:46:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:19,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950182493] [2020-10-20 00:46:19,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:19,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2020-10-20 00:46:19,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816247213] [2020-10-20 00:46:19,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:46:19,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:46:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:46:19,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:46:19,036 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2020-10-20 00:46:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:19,404 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2020-10-20 00:46:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:46:19,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-10-20 00:46:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:19,407 INFO L225 Difference]: With dead ends: 53 [2020-10-20 00:46:19,407 INFO L226 Difference]: Without dead ends: 47 [2020-10-20 00:46:19,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:46:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-20 00:46:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2020-10-20 00:46:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 00:46:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-10-20 00:46:19,417 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 7 [2020-10-20 00:46:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:19,417 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 00:46:19,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:46:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2020-10-20 00:46:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 00:46:19,418 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:19,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:19,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-20 00:46:19,634 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:19,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:19,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1590967926, now seen corresponding path program 1 times [2020-10-20 00:46:19,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:46:19,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623757033] [2020-10-20 00:46:19,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-20 00:46:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:19,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 00:46:19,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:19,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:46:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:19,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623757033] [2020-10-20 00:46:19,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:19,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-20 00:46:19,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635230888] [2020-10-20 00:46:19,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:19,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:46:19,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:19,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:19,757 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 3 states. [2020-10-20 00:46:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:19,787 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-10-20 00:46:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:19,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-20 00:46:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:19,788 INFO L225 Difference]: With dead ends: 39 [2020-10-20 00:46:19,789 INFO L226 Difference]: Without dead ends: 36 [2020-10-20 00:46:19,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-20 00:46:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-20 00:46:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 00:46:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2020-10-20 00:46:19,796 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 13 [2020-10-20 00:46:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:19,796 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-10-20 00:46:19,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-10-20 00:46:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 00:46:19,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:19,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:20,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-20 00:46:20,011 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1590908344, now seen corresponding path program 1 times [2020-10-20 00:46:20,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:46:20,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657322609] [2020-10-20 00:46:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-20 00:46:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:20,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-20 00:46:20,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:20,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:20,143 INFO L384 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 22 treesize of output 7 [2020-10-20 00:46:20,154 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:20,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:20,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:20,192 INFO L384 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 22 treesize of output 7 [2020-10-20 00:46:20,192 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:20,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:20,210 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:20,210 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:27 [2020-10-20 00:46:20,268 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:46:20,268 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:20,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:20,336 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-20 00:46:20,337 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:20,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:20,371 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-20 00:46:20,372 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:20,387 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:20,389 INFO L545 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. [2020-10-20 00:46:20,389 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:70, output treesize:36 [2020-10-20 00:46:20,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:46:20,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:46:20,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:46:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:20,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:46:20,554 INFO L441 ElimStorePlain]: Different costs {4=[|#memory_int|], 6=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_21|]} [2020-10-20 00:46:20,594 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:20,594 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 217 [2020-10-20 00:46:20,596 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,598 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,603 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,607 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,612 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,620 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,623 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,629 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,635 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,636 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,640 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,641 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,651 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,653 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,658 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,670 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,672 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,675 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,676 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,680 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,681 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,687 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,693 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,694 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,697 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,698 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,709 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,712 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,717 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:20,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:20,723 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:21,398 WARN L193 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2020-10-20 00:46:21,399 INFO L625 ElimStorePlain]: treesize reduction 49, result has 80.9 percent of original size [2020-10-20 00:46:21,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,410 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,412 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,415 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,416 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,419 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,422 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,425 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,440 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:21,443 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:21,445 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,447 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,451 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,454 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,455 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,459 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,465 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,470 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,473 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,476 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,477 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,485 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,495 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,497 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,500 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:21,509 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:21,512 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,515 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,516 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,521 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,524 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,527 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,528 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,530 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:21,748 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-20 00:46:21,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:21,756 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,758 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,767 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,788 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,794 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,798 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,800 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,808 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-20 00:46:21,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-20 00:46:21,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,818 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,823 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 00:46:21,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:21,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:46:21,827 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:22,044 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-20 00:46:22,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:22,046 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,048 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,049 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,060 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,061 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,063 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,065 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,068 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,069 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,097 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,099 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,101 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,102 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,104 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,104 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,109 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,110 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,112 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,113 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,115 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,116 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,120 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,121 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,123 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,124 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,126 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,126 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,131 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,133 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,134 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,136 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,138 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:22,138 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:108, output treesize:408 [2020-10-20 00:46:22,139 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,140 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,140 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,142 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,143 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,144 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,146 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,148 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,148 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,150 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,151 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,153 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,154 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,155 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,156 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,157 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,158 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,160 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,161 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,162 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,163 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,165 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,166 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,167 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,168 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,169 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,170 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,172 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,173 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,174 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,175 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,235 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,239 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,240 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,241 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,250 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,251 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,253 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,255 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,259 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,261 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,261 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,268 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,270 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,271 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,272 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,275 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,277 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,277 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,281 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,282 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,287 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,288 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,291 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,294 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,294 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,298 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,299 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,301 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,302 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,304 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,305 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,306 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,310 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,311 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,314 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:22,315 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:46:22,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:46:24,450 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse47 (forall ((v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (or (bvsle c_ULTIMATE.start_main_~state~0 v_arrayElimCell_6) (bvsle v_arrayElimCell_5 c_ULTIMATE.start_main_~state~0) (bvsle v_arrayElimCell_5 v_arrayElimCell_6)))) (.cse16 (forall ((v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (or (bvsle c_ULTIMATE.start_main_~state~0 v_arrayElimCell_6) (bvsle v_arrayElimCell_5 v_arrayElimCell_6)))) (.cse20 (forall ((v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (or (bvsle v_arrayElimCell_5 c_ULTIMATE.start_main_~state~0) (bvsle v_arrayElimCell_5 v_arrayElimCell_6)))) (.cse0 (forall ((v_arrayElimCell_6 (_ BitVec 32))) (bvsle c_ULTIMATE.start_main_~state~0 v_arrayElimCell_6))) (.cse30 (forall ((v_arrayElimCell_5 (_ BitVec 32))) (bvsle v_arrayElimCell_5 c_ULTIMATE.start_main_~state~0)))) (and (or .cse0 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse5 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse5 v_DerPreprocessor_2)))) (let ((.cse2 (select (select .cse4 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse5 v_DerPreprocessor_3)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (let ((.cse3 (select (select .cse4 .cse2) .cse1))) (or (not (= c_ULTIMATE.start_main_~x~0.offset .cse1)) (not (= .cse2 c_ULTIMATE.start_main_~x~0.base)) (= .cse2 .cse3) (= .cse3 c_ULTIMATE.start_main_~x~0.base)))))))) (or .cse0 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse10 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse10 v_DerPreprocessor_3)))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse10 v_DerPreprocessor_2)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse6 (select (select .cse9 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (let ((.cse8 (select (select .cse9 .cse7) .cse6))) (or (not (= c_ULTIMATE.start_main_~x~0.offset .cse6)) (not (= .cse7 c_ULTIMATE.start_main_~x~0.base)) (= .cse6 .cse8) (= c_ULTIMATE.start_main_~x~0.offset .cse8)))))))) (or (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse15 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse15 v_DerPreprocessor_3))) (.cse14 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse15 v_DerPreprocessor_2)))) (let ((.cse13 (select (select .cse14 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse11 (select (select .cse12 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (= .cse11 (select (select .cse12 .cse13) .cse11)) (= (select (select .cse14 .cse13) .cse11) c_ULTIMATE.start_main_~x~0.base)))))) .cse16) (or (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse19 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse19 v_DerPreprocessor_3)))) (let ((.cse17 (select (select .cse18 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (= c_ULTIMATE.start_main_~x~0.offset .cse17) (= .cse17 (select (select .cse18 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse19 v_DerPreprocessor_2)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) .cse17))))))) .cse20) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse25 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse25 v_DerPreprocessor_3))) (.cse24 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse25 v_DerPreprocessor_2)))) (let ((.cse21 (select (select .cse24 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse22 (select (select .cse23 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (= .cse21 c_ULTIMATE.start_main_~x~0.base) (= .cse22 (select (select .cse23 .cse21) .cse22)) (= (select (select .cse24 .cse21) .cse22) c_ULTIMATE.start_main_~x~0.base)))))) (or .cse20 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse29 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse29 v_DerPreprocessor_2)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (= .cse26 c_ULTIMATE.start_main_~x~0.base) (let ((.cse28 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse29 v_DerPreprocessor_3)))) (let ((.cse27 (select (select .cse28 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (= .cse27 (select (select .cse28 .cse26) .cse27))))))))) (or .cse0 .cse30 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse34 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse33 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse34 v_DerPreprocessor_3)))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse34 v_DerPreprocessor_2)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse31 (select (select .cse33 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (not (= c_ULTIMATE.start_main_~x~0.offset .cse31)) (not (= .cse32 c_ULTIMATE.start_main_~x~0.base)) (= .cse31 (select (select .cse33 .cse32) .cse31)))))))) (or (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse39 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse38 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse39 v_DerPreprocessor_3))) (.cse37 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse39 v_DerPreprocessor_2)))) (let ((.cse36 (select (select .cse37 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse35 (select (select .cse38 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (not (= c_ULTIMATE.start_main_~x~0.offset .cse35)) (not (= .cse36 c_ULTIMATE.start_main_~x~0.base)) (= .cse36 (select (select .cse37 .cse36) .cse35)) (= c_ULTIMATE.start_main_~x~0.offset (select (select .cse38 .cse36) .cse35))))))) .cse0) (or .cse16 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse43 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse42 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse43 v_DerPreprocessor_2)))) (let ((.cse40 (select (select .cse42 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (let ((.cse41 (select (select .cse42 .cse40) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse43 v_DerPreprocessor_3)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)))) (or (= .cse40 .cse41) (= .cse41 c_ULTIMATE.start_main_~x~0.base)))))))) (or (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse46 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse45 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse46 v_DerPreprocessor_3)))) (let ((.cse44 (select (select .cse45 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (= .cse44 (select (select .cse45 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse46 v_DerPreprocessor_2)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) .cse44)))))) .cse47) (or .cse30 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse53 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse50 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse53 v_DerPreprocessor_3))) (.cse52 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse53 v_DerPreprocessor_2)))) (let ((.cse49 (select (select .cse52 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse51 (select (select .cse50 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (let ((.cse48 (select (select .cse52 .cse49) .cse51))) (or (not (= .cse48 c_ULTIMATE.start_main_~x~0.base)) (= .cse49 .cse48) (not (= c_ULTIMATE.start_main_~x~0.offset (select (select .cse50 .cse49) .cse51)))))))))) (or (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse56 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse55 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse56 v_DerPreprocessor_2)))) (let ((.cse54 (select (select .cse55 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (= .cse54 (select (select .cse55 .cse54) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse56 v_DerPreprocessor_3)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))))))) .cse47) (or .cse0 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse61 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse59 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse61 v_DerPreprocessor_3))) (.cse60 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse61 v_DerPreprocessor_2)))) (let ((.cse58 (select (select .cse60 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse57 (select (select .cse59 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (not (= c_ULTIMATE.start_main_~x~0.offset .cse57)) (not (= .cse58 c_ULTIMATE.start_main_~x~0.base)) (= .cse57 (select (select .cse59 .cse58) .cse57)) (= (select (select .cse60 .cse58) .cse57) c_ULTIMATE.start_main_~x~0.base))))))) (or .cse20 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse64 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse63 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse64 v_DerPreprocessor_2)))) (let ((.cse62 (select (select .cse63 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (= .cse62 c_ULTIMATE.start_main_~x~0.base) (= .cse62 (select (select .cse63 .cse62) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse64 v_DerPreprocessor_3)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))))))))) (or .cse16 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse69 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse68 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse69 v_DerPreprocessor_3))) (.cse66 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse69 v_DerPreprocessor_2)))) (let ((.cse65 (select (select .cse66 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse67 (select (select .cse68 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (= .cse65 (select (select .cse66 .cse65) .cse67)) (= c_ULTIMATE.start_main_~x~0.offset (select (select .cse68 .cse65) .cse67)))))))) (or .cse16 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse73 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse72 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse73 v_DerPreprocessor_3)))) (let ((.cse70 (select (select .cse72 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (let ((.cse71 (select (select .cse72 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse73 v_DerPreprocessor_2)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) .cse70))) (or (= .cse70 .cse71) (= c_ULTIMATE.start_main_~x~0.offset .cse71)))))))) (or .cse20 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse77 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse74 (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse77 v_DerPreprocessor_3)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (= c_ULTIMATE.start_main_~x~0.offset .cse74) (let ((.cse76 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse77 v_DerPreprocessor_2)))) (let ((.cse75 (select (select .cse76 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (= .cse75 (select (select .cse76 .cse75) .cse74))))))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse82 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse79 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse82 v_DerPreprocessor_3))) (.cse81 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse82 v_DerPreprocessor_2)))) (let ((.cse80 (select (select .cse81 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse78 (select (select .cse79 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (= c_ULTIMATE.start_main_~x~0.offset .cse78) (= .cse78 (select (select .cse79 .cse80) .cse78)) (= (select (select .cse81 .cse80) .cse78) c_ULTIMATE.start_main_~x~0.base)))))) (or .cse30 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse88 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse88 v_DerPreprocessor_3))) (.cse83 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse88 v_DerPreprocessor_2)))) (let ((.cse84 (select (select .cse83 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse85 (select (select .cse87 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (let ((.cse86 (select (select .cse87 .cse84) .cse85))) (or (not (= (select (select .cse83 .cse84) .cse85) c_ULTIMATE.start_main_~x~0.base)) (= .cse85 .cse86) (not (= c_ULTIMATE.start_main_~x~0.offset .cse86))))))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse93 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse92 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse93 v_DerPreprocessor_3))) (.cse90 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse93 v_DerPreprocessor_2)))) (let ((.cse89 (select (select .cse90 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse91 (select (select .cse92 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (= .cse89 c_ULTIMATE.start_main_~x~0.base) (= .cse89 (select (select .cse90 .cse89) .cse91)) (= c_ULTIMATE.start_main_~x~0.offset (select (select .cse92 .cse89) .cse91))))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse97 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse96 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse97 v_DerPreprocessor_3)))) (let ((.cse94 (select (select .cse96 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (let ((.cse95 (select (select .cse96 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse97 v_DerPreprocessor_2)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) .cse94))) (or (= c_ULTIMATE.start_main_~x~0.offset .cse94) (= .cse94 .cse95) (= c_ULTIMATE.start_main_~x~0.offset .cse95))))))) (or .cse0 .cse30 (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse101 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse100 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse101 v_DerPreprocessor_2)))) (let ((.cse99 (select (select .cse100 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse98 (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse101 v_DerPreprocessor_3)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (not (= c_ULTIMATE.start_main_~x~0.offset .cse98)) (not (= .cse99 c_ULTIMATE.start_main_~x~0.base)) (= .cse99 (select (select .cse100 .cse99) .cse98)))))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse105 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse104 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse105 v_DerPreprocessor_2)))) (let ((.cse102 (select (select .cse104 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (let ((.cse103 (select (select .cse104 .cse102) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse105 v_DerPreprocessor_3)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)))) (or (= .cse102 c_ULTIMATE.start_main_~x~0.base) (= .cse102 .cse103) (= .cse103 c_ULTIMATE.start_main_~x~0.base))))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse110 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse109 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse110 v_DerPreprocessor_3)))) (let ((.cse106 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse110 v_DerPreprocessor_2)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse107 (select (select .cse109 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (let ((.cse108 (select (select .cse109 .cse106) .cse107))) (or (= .cse106 c_ULTIMATE.start_main_~x~0.base) (= .cse107 .cse108) (= c_ULTIMATE.start_main_~x~0.offset .cse108))))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse115 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse114 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse115 v_DerPreprocessor_3))) (.cse113 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse115 v_DerPreprocessor_2)))) (let ((.cse112 (select (select .cse113 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse111 (select (select .cse114 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (or (= c_ULTIMATE.start_main_~x~0.offset .cse111) (= .cse112 (select (select .cse113 .cse112) .cse111)) (= c_ULTIMATE.start_main_~x~0.offset (select (select .cse114 .cse112) .cse111))))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (let ((.cse120 (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)))) (let ((.cse119 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) .cse120 v_DerPreprocessor_2)))) (let ((.cse117 (select (select .cse119 c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (.cse116 (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) .cse120 v_DerPreprocessor_3)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) (let ((.cse118 (select (select .cse119 .cse117) .cse116))) (or (= c_ULTIMATE.start_main_~x~0.offset .cse116) (= .cse117 .cse118) (= .cse118 c_ULTIMATE.start_main_~x~0.base))))))))) is different from true [2020-10-20 00:46:24,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:24,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657322609] [2020-10-20 00:46:24,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:24,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 8 [2020-10-20 00:46:24,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336563593] [2020-10-20 00:46:24,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 00:46:24,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:46:24,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 00:46:24,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2020-10-20 00:46:24,518 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 8 states. [2020-10-20 00:46:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:26,242 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2020-10-20 00:46:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:46:26,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-20 00:46:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:26,243 INFO L225 Difference]: With dead ends: 50 [2020-10-20 00:46:26,243 INFO L226 Difference]: Without dead ends: 36 [2020-10-20 00:46:26,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=30, Invalid=45, Unknown=1, NotChecked=14, Total=90 [2020-10-20 00:46:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-20 00:46:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-20 00:46:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 00:46:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2020-10-20 00:46:26,250 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 13 [2020-10-20 00:46:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:26,250 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2020-10-20 00:46:26,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 00:46:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2020-10-20 00:46:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 00:46:26,251 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:26,251 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:26,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-20 00:46:26,460 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:26,461 INFO L82 PathProgramCache]: Analyzing trace with hash -364825411, now seen corresponding path program 1 times [2020-10-20 00:46:26,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:46:26,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314348595] [2020-10-20 00:46:26,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-20 00:46:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:26,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 00:46:26,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 00:46:26,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:46:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 00:46:26,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314348595] [2020-10-20 00:46:26,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:26,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-20 00:46:26,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960142633] [2020-10-20 00:46:26,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:26,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:46:26,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:26,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:26,566 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 3 states. [2020-10-20 00:46:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:26,619 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2020-10-20 00:46:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:26,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-20 00:46:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:26,622 INFO L225 Difference]: With dead ends: 95 [2020-10-20 00:46:26,622 INFO L226 Difference]: Without dead ends: 64 [2020-10-20 00:46:26,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-20 00:46:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 45. [2020-10-20 00:46:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 00:46:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2020-10-20 00:46:26,631 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 15 [2020-10-20 00:46:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:26,631 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2020-10-20 00:46:26,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2020-10-20 00:46:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 00:46:26,632 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:26,632 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:26,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-20 00:46:26,847 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:26,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:26,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2088025541, now seen corresponding path program 1 times [2020-10-20 00:46:26,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:46:26,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449338147] [2020-10-20 00:46:26,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-20 00:46:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:26,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 00:46:26,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:26,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:46:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:26,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449338147] [2020-10-20 00:46:26,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:26,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-20 00:46:26,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745582894] [2020-10-20 00:46:26,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:26,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:46:26,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:26,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:26,942 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 3 states. [2020-10-20 00:46:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:26,996 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2020-10-20 00:46:26,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:26,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-20 00:46:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:26,998 INFO L225 Difference]: With dead ends: 95 [2020-10-20 00:46:26,998 INFO L226 Difference]: Without dead ends: 71 [2020-10-20 00:46:26,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-20 00:46:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2020-10-20 00:46:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-20 00:46:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2020-10-20 00:46:27,006 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 16 [2020-10-20 00:46:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:27,007 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2020-10-20 00:46:27,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2020-10-20 00:46:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 00:46:27,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:27,008 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:27,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-20 00:46:27,220 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1881314605, now seen corresponding path program 1 times [2020-10-20 00:46:27,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:46:27,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508570427] [2020-10-20 00:46:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-20 00:46:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:27,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 00:46:27,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:27,341 INFO L384 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 [2020-10-20 00:46:27,341 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:27,357 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:27,357 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:27,358 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 00:46:27,399 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:27,399 INFO L384 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 19 treesize of output 41 [2020-10-20 00:46:27,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 00:46:27,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508570427] [2020-10-20 00:46:27,403 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 1) [2020-10-20 00:46:27,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [647495015] [2020-10-20 00:46:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 00:46:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:27,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 00:46:27,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:27,585 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-10-20 00:46:27,585 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:27,596 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:27,596 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:27,596 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2020-10-20 00:46:27,630 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:27,631 INFO L384 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 13 treesize of output 17 [2020-10-20 00:46:27,632 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:27,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:27,661 INFO L384 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 [2020-10-20 00:46:27,661 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:27,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:27,680 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:27,680 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:30 [2020-10-20 00:46:27,727 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 00:46:27,727 INFO L384 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 [2020-10-20 00:46:27,728 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:27,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:27,743 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:27,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:30 [2020-10-20 00:46:27,758 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 00:46:27,903 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-10-20 00:46:27,904 INFO L350 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2020-10-20 00:46:27,904 INFO L384 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 71 treesize of output 95 [2020-10-20 00:46:27,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 00:46:27,909 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-10-20 00:46:27,911 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 00:46:27,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 00:46:27,916 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-10-20 00:46:27,918 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 00:46:27,921 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:28,026 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2020-10-20 00:46:28,027 INFO L625 ElimStorePlain]: treesize reduction 35, result has 59.8 percent of original size [2020-10-20 00:46:28,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 00:46:28,040 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:28,040 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:39 [2020-10-20 00:46:28,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 00:46:28,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:28,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:28,112 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 00:46:28,119 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:28,119 INFO L384 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 43 treesize of output 34 [2020-10-20 00:46:28,120 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:28,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:28,128 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-10-20 00:46:28,128 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:28,205 INFO L625 ElimStorePlain]: treesize reduction 12, result has 82.4 percent of original size [2020-10-20 00:46:28,206 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-20 00:46:28,206 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:56 [2020-10-20 00:46:28,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 00:46:28,240 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 1=[|v_#memory_$Pointer$.base_38|]} [2020-10-20 00:46:28,251 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:28,255 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:28,297 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:28,315 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:28,316 INFO L384 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 48 treesize of output 27 [2020-10-20 00:46:28,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 00:46:28,329 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:28,337 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:28,339 INFO L384 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 27 treesize of output 22 [2020-10-20 00:46:28,339 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:28,350 INFO L625 ElimStorePlain]: treesize reduction 9, result has 30.8 percent of original size [2020-10-20 00:46:28,351 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:28,351 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:106, output treesize:4 [2020-10-20 00:46:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:28,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:46:28,382 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:28,387 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:28,387 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:28,388 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2020-10-20 00:46:28,431 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:28,435 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:28,436 INFO L545 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. [2020-10-20 00:46:28,436 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2020-10-20 00:46:30,441 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc5.base_9| (_ BitVec 32)) (v_ULTIMATE.start_main_~x~0.base_41 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset |v_ULTIMATE.start_main_#t~malloc5.base_9|)))) (store .cse0 v_ULTIMATE.start_main_~x~0.base_41 (store (store (select .cse0 v_ULTIMATE.start_main_~x~0.base_41) (_ bv0 32) c_ULTIMATE.start_main_~head~0.base) (_ bv4 32) v_DerPreprocessor_6))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)))) is different from false [2020-10-20 00:46:30,451 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:30,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:30,464 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:30,464 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:45 [2020-10-20 00:46:32,492 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc5.base_9| (_ BitVec 32)) (v_ULTIMATE.start_main_~x~0.base_41 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) (bvadd c_ULTIMATE.start_main_~x~0.offset (_ bv4 32)) v_DerPreprocessor_8) c_ULTIMATE.start_main_~x~0.offset |v_ULTIMATE.start_main_#t~malloc5.base_9|)))) (store .cse0 v_ULTIMATE.start_main_~x~0.base_41 (store (store (select .cse0 v_ULTIMATE.start_main_~x~0.base_41) (_ bv0 32) c_ULTIMATE.start_main_~head~0.base) (_ bv4 32) v_DerPreprocessor_6))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)))) is different from false [2020-10-20 00:46:32,532 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 788462 treesize of output 786414 [2020-10-20 00:46:32,619 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-20 00:46:39,611 WARN L193 SmtUtils]: Spent 6.99 s on a formula simplification. DAG size of input: 831 DAG size of output: 62 [2020-10-20 00:46:39,612 INFO L625 ElimStorePlain]: treesize reduction 783226, result has 0.0 percent of original size [2020-10-20 00:46:39,614 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 00:46:39,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927302303] [2020-10-20 00:46:39,615 INFO L95 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 [2020-10-20 00:46:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:39,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 00:46:39,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:39,689 INFO L384 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 [2020-10-20 00:46:39,690 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:39,697 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:39,698 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:39,698 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 00:46:39,735 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:39,735 INFO L384 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 19 treesize of output 41 [2020-10-20 00:46:39,737 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:39,799 INFO L625 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2020-10-20 00:46:39,805 INFO L384 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 [2020-10-20 00:46:39,805 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:39,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:39,822 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:39,822 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:33 [2020-10-20 00:46:39,878 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 00:46:39,879 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-10-20 00:46:39,879 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:39,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:39,894 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:39,894 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:35 [2020-10-20 00:46:39,942 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:39,942 INFO L384 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 22 treesize of output 32 [2020-10-20 00:46:39,943 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:39,975 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:40,079 INFO L350 Elim1Store]: treesize reduction 16, result has 78.7 percent of original size [2020-10-20 00:46:40,079 INFO L384 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 84 [2020-10-20 00:46:40,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 00:46:40,083 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:40,129 INFO L625 ElimStorePlain]: treesize reduction 36, result has 56.6 percent of original size [2020-10-20 00:46:40,130 INFO L545 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. [2020-10-20 00:46:40,130 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:47 [2020-10-20 00:46:40,284 INFO L350 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2020-10-20 00:46:40,285 INFO L384 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 62 treesize of output 65 [2020-10-20 00:46:40,287 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:40,348 INFO L625 ElimStorePlain]: treesize reduction 34, result has 58.0 percent of original size [2020-10-20 00:46:40,349 INFO L545 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. [2020-10-20 00:46:40,349 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:47 [2020-10-20 00:46:40,363 INFO L441 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 12=[|v_#memory_$Pointer$.base_48|]} [2020-10-20 00:46:40,368 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:40,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:40,440 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:40,441 INFO L384 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 108 treesize of output 90 [2020-10-20 00:46:40,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 00:46:40,446 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-20 00:46:40,446 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 00:46:40,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:40,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-10-20 00:46:40,447 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-10-20 00:46:40,447 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 00:46:41,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:46:41,074 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-10-20 00:46:41,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:46:41 BoogieIcfgContainer [2020-10-20 00:46:41,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:46:41,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:46:41,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:46:41,075 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:46:41,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:18" (3/4) ... [2020-10-20 00:46:41,079 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 00:46:41,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:46:41,081 INFO L168 Benchmark]: Toolchain (without parser) took 24269.59 ms. Allocated memory was 41.9 MB in the beginning and 93.8 MB in the end (delta: 51.9 MB). Free memory was 19.3 MB in the beginning and 68.5 MB in the end (delta: -49.2 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:41,086 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 32.0 MB. Free memory was 9.0 MB in the beginning and 8.9 MB in the end (delta: 68.4 kB). Peak memory consumption was 68.4 kB. Max. memory is 14.3 GB. [2020-10-20 00:46:41,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.21 ms. Allocated memory was 41.9 MB in the beginning and 44.6 MB in the end (delta: 2.6 MB). Free memory was 18.5 MB in the beginning and 23.2 MB in the end (delta: -4.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:41,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.96 ms. Allocated memory is still 44.6 MB. Free memory was 23.2 MB in the beginning and 21.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:41,088 INFO L168 Benchmark]: Boogie Preprocessor took 56.42 ms. Allocated memory is still 44.6 MB. Free memory was 21.0 MB in the beginning and 18.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:41,090 INFO L168 Benchmark]: RCFGBuilder took 511.58 ms. Allocated memory was 44.6 MB in the beginning and 45.1 MB in the end (delta: 524.3 kB). Free memory was 18.7 MB in the beginning and 13.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:41,091 INFO L168 Benchmark]: TraceAbstraction took 23052.50 ms. Allocated memory was 45.1 MB in the beginning and 93.8 MB in the end (delta: 48.8 MB). Free memory was 13.3 MB in the beginning and 68.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 49.5 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:41,091 INFO L168 Benchmark]: Witness Printer took 4.61 ms. Allocated memory is still 93.8 MB. Free memory is still 68.5 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 00:46:41,097 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 32.0 MB. Free memory was 9.0 MB in the beginning and 8.9 MB in the end (delta: 68.4 kB). Peak memory consumption was 68.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 577.21 ms. Allocated memory was 41.9 MB in the beginning and 44.6 MB in the end (delta: 2.6 MB). Free memory was 18.5 MB in the beginning and 23.2 MB in the end (delta: -4.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 53.96 ms. Allocated memory is still 44.6 MB. Free memory was 23.2 MB in the beginning and 21.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 56.42 ms. Allocated memory is still 44.6 MB. Free memory was 21.0 MB in the beginning and 18.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * RCFGBuilder took 511.58 ms. Allocated memory was 44.6 MB in the beginning and 45.1 MB in the end (delta: 524.3 kB). Free memory was 18.7 MB in the beginning and 13.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 14.3 GB. * TraceAbstraction took 23052.50 ms. Allocated memory was 45.1 MB in the beginning and 93.8 MB in the end (delta: 48.8 MB). Free memory was 13.3 MB in the beginning and 68.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 49.5 MB. Max. memory is 14.3 GB. * Witness Printer took 4.61 ms. Allocated memory is still 93.8 MB. Free memory is still 68.5 MB. There was no memory consumed. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = head [L998] head->data = 0 [L1000] SLL* x = head; [L1001] int state = 1; [L1004] COND TRUE __VERIFIER_nondet_int() [L1007] x->next = malloc(sizeof(SLL)) [L1008] EXPR x->next [L1008] x = x->next [L1009] x->next = head [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1021] x->data = state [L1023] COND FALSE !(!(((void*)0) != x)) [L1004] COND TRUE __VERIFIER_nondet_int() [L1007] x->next = malloc(sizeof(SLL)) [L1008] EXPR x->next [L1008] x = x->next [L1009] x->next = head [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1021] x->data = state [L1023] COND FALSE !(!(((void*)0) != x)) [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state [L1027] EXPR head->next [L1027] x = head->next [L1028] COND TRUE !(((void*)0) != x) [L985] COND FALSE !(0) [L985] __assert_fail ("0", "sll-circular-1.c", 14, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 22.9s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 193 SDtfs, 92 SDslu, 159 SDs, 0 SdLazy, 100 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 50 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 130 ConstructedInterpolants, 10 QuantifiedInterpolants, 49918 SizeOfPredicates, 24 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...