./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test27-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test27-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e697b26a33773e62711271acc7c4dca91991203b ............................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test27-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e697b26a33773e62711271acc7c4dca91991203b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:38,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:38,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:38,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:38,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:38,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:38,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:38,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:38,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:38,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:38,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:38,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:38,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:38,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:38,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:38,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:38,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:38,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:38,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:38,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:38,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:38,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:38,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:38,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:38,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:38,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:38,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:38,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:38,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:38,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:38,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:38,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:38,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:38,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:38,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:38,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:38,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:38,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:38,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:38,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:38,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:38,329 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:01:38,346 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:38,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:38,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:38,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:38,348 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:38,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:38,348 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:38,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:38,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:38,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:38,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:38,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:38,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:38,350 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:38,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:38,351 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:38,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:38,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:38,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:38,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:38,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:38,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:38,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:38,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:38,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:38,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:38,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:38,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:38,354 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e697b26a33773e62711271acc7c4dca91991203b [2019-10-22 09:01:38,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:38,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:38,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:38,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:38,408 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:38,409 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/test27-1.c [2019-10-22 09:01:38,467 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/data/79df50d70/0de1ef3db7cd4a2cb53e1ad8633cb6f4/FLAG48e9b17f9 [2019-10-22 09:01:38,847 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:38,848 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/sv-benchmarks/c/ldv-regression/test27-1.c [2019-10-22 09:01:38,855 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/data/79df50d70/0de1ef3db7cd4a2cb53e1ad8633cb6f4/FLAG48e9b17f9 [2019-10-22 09:01:38,868 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/data/79df50d70/0de1ef3db7cd4a2cb53e1ad8633cb6f4 [2019-10-22 09:01:38,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:38,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:38,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:38,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:38,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:38,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:38" (1/1) ... [2019-10-22 09:01:38,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7587b7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:38, skipping insertion in model container [2019-10-22 09:01:38,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:38" (1/1) ... [2019-10-22 09:01:38,889 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:38,908 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:39,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:39,150 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:39,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:39,184 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:39,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39 WrapperNode [2019-10-22 09:01:39,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:39,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:39,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:39,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:39,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (1/1) ... [2019-10-22 09:01:39,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (1/1) ... [2019-10-22 09:01:39,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:39,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:39,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:39,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:39,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (1/1) ... [2019-10-22 09:01:39,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (1/1) ... [2019-10-22 09:01:39,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (1/1) ... [2019-10-22 09:01:39,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (1/1) ... [2019-10-22 09:01:39,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (1/1) ... [2019-10-22 09:01:39,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (1/1) ... [2019-10-22 09:01:39,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (1/1) ... [2019-10-22 09:01:39,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:39,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:39,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:39,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:39,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:01:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:01:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:39,661 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:39,661 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:01:39,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:39 BoogieIcfgContainer [2019-10-22 09:01:39,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:39,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:39,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:39,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:39,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:38" (1/3) ... [2019-10-22 09:01:39,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300341f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:39, skipping insertion in model container [2019-10-22 09:01:39,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:39" (2/3) ... [2019-10-22 09:01:39,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300341f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:39, skipping insertion in model container [2019-10-22 09:01:39,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:39" (3/3) ... [2019-10-22 09:01:39,670 INFO L109 eAbstractionObserver]: Analyzing ICFG test27-1.c [2019-10-22 09:01:39,680 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:39,688 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:39,700 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:39,725 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:39,725 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:39,726 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:39,726 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:39,726 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:39,727 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:39,727 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:39,727 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-22 09:01:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 09:01:39,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:39,748 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:39,751 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:39,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash -631347226, now seen corresponding path program 1 times [2019-10-22 09:01:39,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:39,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44415714] [2019-10-22 09:01:39,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:40,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44415714] [2019-10-22 09:01:40,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:40,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:40,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525187036] [2019-10-22 09:01:40,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 09:01:40,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:40,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:01:40,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:01:40,055 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-10-22 09:01:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,071 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-10-22 09:01:40,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:01:40,072 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-22 09:01:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,083 INFO L225 Difference]: With dead ends: 30 [2019-10-22 09:01:40,083 INFO L226 Difference]: Without dead ends: 13 [2019-10-22 09:01:40,089 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:01:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-22 09:01:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 09:01:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 09:01:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 09:01:40,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-10-22 09:01:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,130 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 09:01:40,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 09:01:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-22 09:01:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 09:01:40,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,131 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:40,132 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:40,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1697064536, now seen corresponding path program 1 times [2019-10-22 09:01:40,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065607520] [2019-10-22 09:01:40,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:40,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065607520] [2019-10-22 09:01:40,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:40,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:40,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180165645] [2019-10-22 09:01:40,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:40,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:40,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:40,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:40,197 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-10-22 09:01:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,238 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-10-22 09:01:40,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:40,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 09:01:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,244 INFO L225 Difference]: With dead ends: 24 [2019-10-22 09:01:40,244 INFO L226 Difference]: Without dead ends: 15 [2019-10-22 09:01:40,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-22 09:01:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-22 09:01:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 09:01:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-22 09:01:40,253 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-10-22 09:01:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,253 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-22 09:01:40,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-22 09:01:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:01:40,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,254 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:40,255 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1434190826, now seen corresponding path program 1 times [2019-10-22 09:01:40,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619737403] [2019-10-22 09:01:40,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:40,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619737403] [2019-10-22 09:01:40,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129029143] [2019-10-22 09:01:40,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:40,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:40,493 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:40,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-22 09:01:40,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668012938] [2019-10-22 09:01:40,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:40,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:40,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:40,498 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-10-22 09:01:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,531 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-10-22 09:01:40,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:40,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 09:01:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,533 INFO L225 Difference]: With dead ends: 26 [2019-10-22 09:01:40,533 INFO L226 Difference]: Without dead ends: 17 [2019-10-22 09:01:40,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-22 09:01:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-22 09:01:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 09:01:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-22 09:01:40,540 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-10-22 09:01:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,541 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-22 09:01:40,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-22 09:01:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 09:01:40,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,542 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:40,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:40,744 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash 201480788, now seen corresponding path program 2 times [2019-10-22 09:01:40,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874352168] [2019-10-22 09:01:40,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:40,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874352168] [2019-10-22 09:01:40,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468212875] [2019-10-22 09:01:40,823 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:40,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:40,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:40,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:01:40,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:41,072 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-10-22 09:01:41,073 INFO L341 Elim1Store]: treesize reduction 28, result has 77.2 percent of original size [2019-10-22 09:01:41,074 INFO L375 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 2 case distinctions, treesize of input 69 treesize of output 102 [2019-10-22 09:01:41,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:41,227 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-22 09:01:41,228 INFO L567 ElimStorePlain]: treesize reduction 42, result has 84.6 percent of original size [2019-10-22 09:01:41,406 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-10-22 09:01:41,406 INFO L341 Elim1Store]: treesize reduction 28, result has 78.8 percent of original size [2019-10-22 09:01:41,407 INFO L375 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 2 case distinctions, treesize of input 91 treesize of output 113 [2019-10-22 09:01:41,408 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:41,554 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-22 09:01:41,555 INFO L567 ElimStorePlain]: treesize reduction 46, result has 81.7 percent of original size [2019-10-22 09:01:41,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:41,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:41,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:01:41,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:41,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:01:41,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:41,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:41,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:01:41,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts. [2019-10-22 09:01:41,613 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:241, output treesize:1520 [2019-10-22 09:01:42,067 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 32 [2019-10-22 09:01:42,117 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:42,118 INFO L375 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 125 [2019-10-22 09:01:42,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,138 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:42,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:42,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:42,374 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) 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) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-22 09:01:42,378 INFO L168 Benchmark]: Toolchain (without parser) took 3505.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 949.9 MB in the beginning and 935.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 149.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:42,379 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:42,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:42,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:42,380 INFO L168 Benchmark]: Boogie Preprocessor took 30.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:42,380 INFO L168 Benchmark]: RCFGBuilder took 395.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:42,381 INFO L168 Benchmark]: TraceAbstraction took 2713.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 935.5 MB in the end (delta: 164.7 MB). Peak memory consumption was 164.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:42,383 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 395.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2713.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 935.5 MB in the end (delta: 164.7 MB). Peak memory consumption was 164.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:44,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:44,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:44,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:44,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:44,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:44,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:44,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:44,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:44,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:44,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:44,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:44,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:44,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:44,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:44,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:44,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:44,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:44,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:44,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:44,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:44,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:44,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:44,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:44,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:44,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:44,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:44,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:44,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:44,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:44,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:44,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:44,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:44,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:44,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:44,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:44,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:44,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:44,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:44,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:44,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:44,506 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-10-22 09:01:44,517 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:44,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:44,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:44,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:44,519 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:44,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:44,519 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:44,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:44,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:44,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:44,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:44,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:44,520 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 09:01:44,520 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 09:01:44,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:44,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:44,520 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:44,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:44,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:44,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:44,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:44,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:44,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:44,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:44,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:44,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:44,522 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-10-22 09:01:44,522 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 09:01:44,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:44,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 09:01:44,523 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e697b26a33773e62711271acc7c4dca91991203b [2019-10-22 09:01:44,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:44,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:44,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:44,578 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:44,579 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:44,579 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/test27-1.c [2019-10-22 09:01:44,643 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/data/a17ff9193/5d1d7357cd27483a8c54abf9a5f8c117/FLAGf70727871 [2019-10-22 09:01:45,053 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:45,058 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/sv-benchmarks/c/ldv-regression/test27-1.c [2019-10-22 09:01:45,065 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/data/a17ff9193/5d1d7357cd27483a8c54abf9a5f8c117/FLAGf70727871 [2019-10-22 09:01:45,427 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/data/a17ff9193/5d1d7357cd27483a8c54abf9a5f8c117 [2019-10-22 09:01:45,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:45,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:45,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:45,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:45,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:45,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da98343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45, skipping insertion in model container [2019-10-22 09:01:45,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,446 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:45,462 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:45,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:45,664 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:45,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:45,764 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:45,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45 WrapperNode [2019-10-22 09:01:45,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:45,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:45,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:45,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:45,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:45,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:45,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:45,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:45,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:45,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:45,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:45,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:45,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:01:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:01:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 09:01:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:45,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 09:01:46,327 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:46,327 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:01:46,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:46 BoogieIcfgContainer [2019-10-22 09:01:46,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:46,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:46,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:46,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:46,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:45" (1/3) ... [2019-10-22 09:01:46,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473552eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:46, skipping insertion in model container [2019-10-22 09:01:46,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (2/3) ... [2019-10-22 09:01:46,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473552eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:46, skipping insertion in model container [2019-10-22 09:01:46,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:46" (3/3) ... [2019-10-22 09:01:46,336 INFO L109 eAbstractionObserver]: Analyzing ICFG test27-1.c [2019-10-22 09:01:46,345 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:46,358 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:46,365 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:46,383 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:46,383 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:46,383 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:46,383 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:46,383 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:46,384 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:46,384 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:46,384 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-22 09:01:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 09:01:46,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,398 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,399 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash -631347226, now seen corresponding path program 1 times [2019-10-22 09:01:46,411 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:46,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1945279571] [2019-10-22 09:01:46,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,546 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1945279571] [2019-10-22 09:01:46,551 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 09:01:46,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165317094] [2019-10-22 09:01:46,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 09:01:46,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:46,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:01:46,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:01:46,572 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-10-22 09:01:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,589 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-10-22 09:01:46,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:01:46,591 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-22 09:01:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,600 INFO L225 Difference]: With dead ends: 30 [2019-10-22 09:01:46,600 INFO L226 Difference]: Without dead ends: 13 [2019-10-22 09:01:46,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:01:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-22 09:01:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 09:01:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 09:01:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 09:01:46,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-10-22 09:01:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,632 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 09:01:46,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 09:01:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-22 09:01:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 09:01:46,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,633 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:46,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1697064536, now seen corresponding path program 1 times [2019-10-22 09:01:46,834 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:46,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [931099940] [2019-10-22 09:01:46,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,964 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [931099940] [2019-10-22 09:01:46,977 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:46,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024241146] [2019-10-22 09:01:46,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:46,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:46,980 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2019-10-22 09:01:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,080 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-10-22 09:01:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:47,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 09:01:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,082 INFO L225 Difference]: With dead ends: 25 [2019-10-22 09:01:47,082 INFO L226 Difference]: Without dead ends: 16 [2019-10-22 09:01:47,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-22 09:01:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 09:01:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 09:01:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-22 09:01:47,088 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2019-10-22 09:01:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,089 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-22 09:01:47,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-22 09:01:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 09:01:47,090 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,090 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:47,291 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash 201480788, now seen corresponding path program 1 times [2019-10-22 09:01:47,292 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:47,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [841308130] [2019-10-22 09:01:47,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:47,471 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:47,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [841308130] [2019-10-22 09:01:47,535 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:47,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-22 09:01:47,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098336698] [2019-10-22 09:01:47,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:01:47,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:47,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:01:47,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:47,538 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2019-10-22 09:01:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,928 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-10-22 09:01:47,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:47,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-10-22 09:01:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,931 INFO L225 Difference]: With dead ends: 33 [2019-10-22 09:01:47,931 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 09:01:47,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 09:01:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-22 09:01:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 09:01:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-22 09:01:47,937 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2019-10-22 09:01:47,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,937 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-22 09:01:47,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:01:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-22 09:01:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:01:47,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,939 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:48,140 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:48,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash -616519604, now seen corresponding path program 2 times [2019-10-22 09:01:48,141 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:48,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1272183579] [2019-10-22 09:01:48,141 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a86e3df9-2d49-4bf4-843c-42632eef2eaa/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:48,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:48,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:48,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,683 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:48,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-10-22 09:01:48,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:48,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:48,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:48,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:34 [2019-10-22 09:01:48,808 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|, |v_#memory_$Pointer$.base_17|, |v_#memory_$Pointer$.offset_17|], 2=[|v_#memory_int_18|, |v_#memory_int_19|]} [2019-10-22 09:01:49,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2019-10-22 09:01:49,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:51,310 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 91 [2019-10-22 09:01:51,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:51,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 27 [2019-10-22 09:01:51,482 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:52,179 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-22 09:01:52,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:52,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:52,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 33 [2019-10-22 09:01:52,280 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:52,519 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-22 09:01:52,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:52,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-10-22 09:01:52,549 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:52,686 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-22 09:01:52,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:52,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 09:01:52,709 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:52,826 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-22 09:01:52,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:52,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:52,829 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:345, output treesize:250 [2019-10-22 09:01:52,967 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-10-22 09:01:52,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:52,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:53,003 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 09:01:53,236 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-10-22 09:01:53,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:53,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 331 treesize of output 317 [2019-10-22 09:01:53,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,535 INFO L496 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:53,829 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 61 [2019-10-22 09:01:53,830 INFO L567 ElimStorePlain]: treesize reduction 262, result has 31.2 percent of original size [2019-10-22 09:01:53,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:53,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 79 [2019-10-22 09:01:53,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:54,053 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-10-22 09:01:54,053 INFO L567 ElimStorePlain]: treesize reduction 5, result has 92.3 percent of original size [2019-10-22 09:01:54,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:54,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:344, output treesize:34 [2019-10-22 09:01:54,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 09:01:54,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2019-10-22 09:01:54,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:54,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:54,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:54,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:16 [2019-10-22 09:01:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 09:01:54,197 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:54,391 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_int|], 2=[|v_#memory_int_21|, |v_#memory_int_18|, |v_#memory_int_19|], 8=[|v_#memory_$Pointer$.base_17|, |v_#memory_$Pointer$.offset_17|]} [2019-10-22 09:01:54,620 INFO L235 Elim1Store]: Index analysis took 143 ms [2019-10-22 09:01:54,815 INFO L341 Elim1Store]: treesize reduction 28, result has 48.1 percent of original size [2019-10-22 09:01:54,816 INFO L375 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 1 case distinctions, treesize of input 40 treesize of output 26 [2019-10-22 09:01:54,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 09:01:55,299 WARN L191 SmtUtils]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-22 09:01:55,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:55,345 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:55,719 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 09:01:55,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:03,973 WARN L191 SmtUtils]: Spent 8.13 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-22 09:02:03,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:03,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 87 [2019-10-22 09:02:03,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:03,977 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:12,472 WARN L191 SmtUtils]: Spent 8.49 s on a formula simplification that was a NOOP. DAG size: 82 [2019-10-22 09:02:12,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:12,861 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-22 09:02:12,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:12,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2149 treesize of output 2179 [2019-10-22 09:02:12,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:12,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:12,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:12,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,966 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,424 WARN L191 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-10-22 09:02:17,425 INFO L567 ElimStorePlain]: treesize reduction 5291, result has 23.2 percent of original size [2019-10-22 09:02:17,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:02:17,626 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) 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) [2019-10-22 09:02:17,630 INFO L168 Benchmark]: Toolchain (without parser) took 32199.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 84.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:17,631 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:17,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -209.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:17,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:17,632 INFO L168 Benchmark]: Boogie Preprocessor took 34.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:17,632 INFO L168 Benchmark]: RCFGBuilder took 480.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:17,633 INFO L168 Benchmark]: TraceAbstraction took 31299.51 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 101.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:17,636 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -209.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 480.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31299.51 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 101.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...