./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/eqn1f.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/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/eqn1f.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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 b294b69c7e36d528e963d4d19e42533f57ed2d99 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/eqn1f.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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 b294b69c7e36d528e963d4d19e42533f57ed2d99 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:01:29,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:01:29,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:01:29,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:01:29,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:01:29,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:01:29,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:01:29,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:01:29,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:01:29,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:01:29,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:01:29,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:01:29,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:01:29,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:01:29,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:01:29,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:01:29,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:01:29,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:01:29,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:01:29,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:01:29,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:01:29,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:01:29,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:01:29,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:01:29,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:01:29,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:01:29,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:01:29,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:01:29,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:01:29,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:01:29,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:01:29,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:01:29,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:01:29,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:01:29,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:01:29,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:01:29,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:01:29,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:01:29,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:01:29,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:01:29,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:01:29,308 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:01:29,332 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:01:29,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:01:29,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:01:29,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:01:29,334 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:01:29,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:01:29,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:01:29,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:01:29,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:01:29,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:01:29,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:01:29,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:01:29,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:01:29,336 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:01:29,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:01:29,336 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:01:29,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:01:29,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:01:29,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:01:29,337 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:01:29,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:01:29,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:01:29,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:01:29,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:01:29,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:01:29,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:01:29,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:01:29,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:01:29,339 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/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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 -> b294b69c7e36d528e963d4d19e42533f57ed2d99 [2019-11-16 00:01:29,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:01:29,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:01:29,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:01:29,396 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:01:29,396 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:01:29,397 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/../../sv-benchmarks/c/array-fpi/eqn1f.c [2019-11-16 00:01:29,453 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/data/f5c41c0a6/217aa67476fd4b1b9770e55e21a0266a/FLAG710c5caff [2019-11-16 00:01:29,881 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:01:29,881 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/sv-benchmarks/c/array-fpi/eqn1f.c [2019-11-16 00:01:29,888 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/data/f5c41c0a6/217aa67476fd4b1b9770e55e21a0266a/FLAG710c5caff [2019-11-16 00:01:29,904 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/data/f5c41c0a6/217aa67476fd4b1b9770e55e21a0266a [2019-11-16 00:01:29,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:01:29,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:01:29,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:01:29,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:01:29,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:01:29,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:01:29" (1/1) ... [2019-11-16 00:01:29,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a09db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:29, skipping insertion in model container [2019-11-16 00:01:29,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:01:29" (1/1) ... [2019-11-16 00:01:29,927 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:01:29,951 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:01:30,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:01:30,204 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:01:30,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:01:30,252 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:01:30,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30 WrapperNode [2019-11-16 00:01:30,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:01:30,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:01:30,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:01:30,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:01:30,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (1/1) ... [2019-11-16 00:01:30,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (1/1) ... [2019-11-16 00:01:30,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:01:30,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:01:30,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:01:30,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:01:30,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (1/1) ... [2019-11-16 00:01:30,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (1/1) ... [2019-11-16 00:01:30,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (1/1) ... [2019-11-16 00:01:30,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (1/1) ... [2019-11-16 00:01:30,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (1/1) ... [2019-11-16 00:01:30,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (1/1) ... [2019-11-16 00:01:30,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (1/1) ... [2019-11-16 00:01:30,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:01:30,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:01:30,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:01:30,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:01:30,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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-11-16 00:01:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:01:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:01:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:01:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:01:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:01:30,627 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:01:30,627 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:01:30,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:30 BoogieIcfgContainer [2019-11-16 00:01:30,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:01:30,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:01:30,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:01:30,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:01:30,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:01:29" (1/3) ... [2019-11-16 00:01:30,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6965d886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:01:30, skipping insertion in model container [2019-11-16 00:01:30,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:30" (2/3) ... [2019-11-16 00:01:30,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6965d886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:01:30, skipping insertion in model container [2019-11-16 00:01:30,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:30" (3/3) ... [2019-11-16 00:01:30,635 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn1f.c [2019-11-16 00:01:30,643 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:01:30,649 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:01:30,660 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:01:30,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:01:30,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:01:30,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:01:30,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:01:30,682 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:01:30,682 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:01:30,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:01:30,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:01:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-16 00:01:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:01:30,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:30,702 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:30,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:30,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:30,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1486647931, now seen corresponding path program 1 times [2019-11-16 00:01:30,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:30,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761241283] [2019-11-16 00:01:30,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:30,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:30,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:30,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761241283] [2019-11-16 00:01:30,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:30,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:01:30,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685030033] [2019-11-16 00:01:30,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:01:30,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:30,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:01:30,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:01:30,863 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-16 00:01:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:30,876 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-16 00:01:30,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:01:30,877 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-16 00:01:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:30,885 INFO L225 Difference]: With dead ends: 33 [2019-11-16 00:01:30,885 INFO L226 Difference]: Without dead ends: 15 [2019-11-16 00:01:30,888 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-11-16 00:01:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-16 00:01:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-16 00:01:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:01:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-16 00:01:30,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-11-16 00:01:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:30,919 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-16 00:01:30,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:01:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-16 00:01:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:01:30,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:30,920 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:30,920 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1772723449, now seen corresponding path program 1 times [2019-11-16 00:01:30,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:30,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466270822] [2019-11-16 00:01:30,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:30,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:30,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:30,939 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:01:30,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037732619] [2019-11-16 00:01:30,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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-11-16 00:01:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:01:31,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:31,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:31,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-11-16 00:01:31,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:31,147 INFO L567 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-11-16 00:01:31,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:01:31,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-11-16 00:01:31,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:31,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466270822] [2019-11-16 00:01:31,184 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:01:31,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037732619] [2019-11-16 00:01:31,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:31,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:31,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178240629] [2019-11-16 00:01:31,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:31,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:31,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:31,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:31,187 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2019-11-16 00:01:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:31,283 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-11-16 00:01:31,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:01:31,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-16 00:01:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:31,284 INFO L225 Difference]: With dead ends: 32 [2019-11-16 00:01:31,284 INFO L226 Difference]: Without dead ends: 30 [2019-11-16 00:01:31,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-16 00:01:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2019-11-16 00:01:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:01:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-16 00:01:31,291 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2019-11-16 00:01:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:31,291 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-16 00:01:31,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-16 00:01:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:01:31,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:31,293 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:31,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:31,503 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:31,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash 130601367, now seen corresponding path program 1 times [2019-11-16 00:01:31,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:31,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848703099] [2019-11-16 00:01:31,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:31,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:31,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:31,526 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:01:31,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802653299] [2019-11-16 00:01:31,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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-11-16 00:01:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:01:31,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:31,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848703099] [2019-11-16 00:01:31,594 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:01:31,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802653299] [2019-11-16 00:01:31,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:31,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:31,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294606304] [2019-11-16 00:01:31,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:31,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:31,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:31,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:31,596 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2019-11-16 00:01:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:31,697 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-11-16 00:01:31,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:01:31,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-16 00:01:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:31,698 INFO L225 Difference]: With dead ends: 47 [2019-11-16 00:01:31,698 INFO L226 Difference]: Without dead ends: 38 [2019-11-16 00:01:31,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-16 00:01:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2019-11-16 00:01:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:01:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-16 00:01:31,704 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-11-16 00:01:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:31,704 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-16 00:01:31,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-16 00:01:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:01:31,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:31,705 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:31,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:31,916 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash 827904471, now seen corresponding path program 1 times [2019-11-16 00:01:31,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:31,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753779074] [2019-11-16 00:01:31,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:31,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:31,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:31,935 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:01:31,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152546998] [2019-11-16 00:01:31,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:01:31,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:32,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753779074] [2019-11-16 00:01:32,020 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:01:32,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152546998] [2019-11-16 00:01:32,021 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:01:32,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-16 00:01:32,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827703411] [2019-11-16 00:01:32,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:32,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:32,022 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-16 00:01:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:32,105 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-16 00:01:32,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:01:32,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-16 00:01:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:32,106 INFO L225 Difference]: With dead ends: 42 [2019-11-16 00:01:32,107 INFO L226 Difference]: Without dead ends: 35 [2019-11-16 00:01:32,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-16 00:01:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2019-11-16 00:01:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:01:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-16 00:01:32,112 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2019-11-16 00:01:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:32,112 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-16 00:01:32,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-16 00:01:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:01:32,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:32,114 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:32,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:32,317 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:32,317 INFO L82 PathProgramCache]: Analyzing trace with hash 437833903, now seen corresponding path program 1 times [2019-11-16 00:01:32,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:32,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111870851] [2019-11-16 00:01:32,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:32,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:32,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:32,326 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:01:32,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275112857] [2019-11-16 00:01:32,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:01:32,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:32,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111870851] [2019-11-16 00:01:32,403 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:01:32,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275112857] [2019-11-16 00:01:32,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:32,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:32,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163136665] [2019-11-16 00:01:32,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:32,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:32,405 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-11-16 00:01:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:32,510 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-16 00:01:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:01:32,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-16 00:01:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:32,514 INFO L225 Difference]: With dead ends: 39 [2019-11-16 00:01:32,515 INFO L226 Difference]: Without dead ends: 25 [2019-11-16 00:01:32,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:01:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-16 00:01:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-16 00:01:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:01:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-16 00:01:32,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2019-11-16 00:01:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:32,519 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-16 00:01:32,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-16 00:01:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:01:32,519 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:32,520 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:32,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:32,720 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:32,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1602337035, now seen corresponding path program 1 times [2019-11-16 00:01:32,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:32,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648362344] [2019-11-16 00:01:32,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:32,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:32,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:32,757 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:01:32,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30540716] [2019-11-16 00:01:32,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:01:32,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:32,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:01:32,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:32,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:32,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-16 00:01:32,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:32,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:32,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:01:32,842 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2019-11-16 00:01:32,908 INFO L341 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2019-11-16 00:01:32,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2019-11-16 00:01:32,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:32,956 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2019-11-16 00:01:32,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:32,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:01:32,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2019-11-16 00:01:32,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:33,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:33,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:33,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:33,093 INFO L392 ElimStorePlain]: Different costs {12=[v_prenex_4], 20=[|v_#memory_int_12|]} [2019-11-16 00:01:33,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:01:33,106 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-16 00:01:33,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2019-11-16 00:01:33,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:33,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:33,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:01:33,193 INFO L341 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2019-11-16 00:01:33,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 89 [2019-11-16 00:01:33,195 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:33,276 INFO L567 ElimStorePlain]: treesize reduction 50, result has 66.4 percent of original size [2019-11-16 00:01:33,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-16 00:01:33,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:99 [2019-11-16 00:01:33,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:33,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:33,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:33,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648362344] [2019-11-16 00:01:33,423 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:01:33,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30540716] [2019-11-16 00:01:33,424 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:01:33,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-16 00:01:33,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116533141] [2019-11-16 00:01:33,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:01:33,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:33,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:01:33,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:01:33,426 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2019-11-16 00:01:33,606 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-16 00:01:33,888 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-11-16 00:01:34,050 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-11-16 00:01:34,222 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-16 00:01:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:34,431 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-16 00:01:34,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:01:34,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-16 00:01:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:34,432 INFO L225 Difference]: With dead ends: 42 [2019-11-16 00:01:34,433 INFO L226 Difference]: Without dead ends: 40 [2019-11-16 00:01:34,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:01:34,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-16 00:01:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2019-11-16 00:01:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:01:34,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-16 00:01:34,439 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2019-11-16 00:01:34,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:34,439 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-16 00:01:34,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:01:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-16 00:01:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:01:34,440 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:34,441 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:34,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:34,644 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash -602215277, now seen corresponding path program 2 times [2019-11-16 00:01:34,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:34,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084797836] [2019-11-16 00:01:34,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:34,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:34,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:34,671 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:01:34,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1287954259] [2019-11-16 00:01:34,671 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:34,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:01:34,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:34,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:01:34,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:34,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084797836] [2019-11-16 00:01:34,760 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:01:34,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287954259] [2019-11-16 00:01:34,761 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:01:34,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-16 00:01:34,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510942157] [2019-11-16 00:01:34,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:01:34,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:34,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:01:34,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:34,762 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 7 states. [2019-11-16 00:01:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:34,895 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-11-16 00:01:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:01:34,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-16 00:01:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:34,899 INFO L225 Difference]: With dead ends: 59 [2019-11-16 00:01:34,900 INFO L226 Difference]: Without dead ends: 50 [2019-11-16 00:01:34,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:01:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-16 00:01:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 26. [2019-11-16 00:01:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:01:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-11-16 00:01:34,905 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2019-11-16 00:01:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:34,906 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-11-16 00:01:34,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:01:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-11-16 00:01:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:01:34,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:34,907 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:35,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:35,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash -508830509, now seen corresponding path program 3 times [2019-11-16 00:01:35,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:35,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113518382] [2019-11-16 00:01:35,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:35,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:35,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:35,121 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:01:35,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736441501] [2019-11-16 00:01:35,122 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:35,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:01:35,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:35,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:01:35,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:35,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113518382] [2019-11-16 00:01:35,209 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:01:35,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736441501] [2019-11-16 00:01:35,210 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:01:35,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-16 00:01:35,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323952424] [2019-11-16 00:01:35,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:01:35,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:01:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:35,211 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-11-16 00:01:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:35,319 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-16 00:01:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:01:35,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-16 00:01:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:35,320 INFO L225 Difference]: With dead ends: 54 [2019-11-16 00:01:35,320 INFO L226 Difference]: Without dead ends: 47 [2019-11-16 00:01:35,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:01:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-16 00:01:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2019-11-16 00:01:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:01:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-16 00:01:35,325 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2019-11-16 00:01:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:35,326 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-16 00:01:35,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:01:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-16 00:01:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:01:35,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:35,326 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:35,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:35,527 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:35,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:35,527 INFO L82 PathProgramCache]: Analyzing trace with hash 575675563, now seen corresponding path program 1 times [2019-11-16 00:01:35,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:35,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577592896] [2019-11-16 00:01:35,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:35,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:35,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:35,537 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:01:35,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29508028] [2019-11-16 00:01:35,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-16 00:01:35,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:35,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:01:35,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:35,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:35,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-16 00:01:35,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:35,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:35,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:01:35,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2019-11-16 00:01:35,665 INFO L341 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2019-11-16 00:01:35,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2019-11-16 00:01:35,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:35,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:35,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:01:35,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-16 00:01:35,709 INFO L341 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2019-11-16 00:01:35,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 46 [2019-11-16 00:01:35,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:35,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:35,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:01:35,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:53 [2019-11-16 00:01:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:35,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577592896] [2019-11-16 00:01:35,968 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:01:35,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29508028] [2019-11-16 00:01:35,968 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:01:35,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-11-16 00:01:35,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648861786] [2019-11-16 00:01:35,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:01:35,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:35,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:01:35,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:01:35,970 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2019-11-16 00:01:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:36,311 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-16 00:01:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:01:36,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-16 00:01:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:36,316 INFO L225 Difference]: With dead ends: 43 [2019-11-16 00:01:36,316 INFO L226 Difference]: Without dead ends: 41 [2019-11-16 00:01:36,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:01:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-16 00:01:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2019-11-16 00:01:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-16 00:01:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-16 00:01:36,321 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2019-11-16 00:01:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:36,322 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-16 00:01:36,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:01:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-16 00:01:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:01:36,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:36,324 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:36,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:36,527 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:36,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2009431311, now seen corresponding path program 4 times [2019-11-16 00:01:36,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:36,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201750328] [2019-11-16 00:01:36,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:36,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:36,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:36,540 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:01:36,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864477235] [2019-11-16 00:01:36,540 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:36,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:01:36,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:36,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:01:36,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:36,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:01:36,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:36,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:36,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-16 00:01:36,613 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:36,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:36,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:01:36,621 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2019-11-16 00:01:36,677 INFO L341 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2019-11-16 00:01:36,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2019-11-16 00:01:36,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:36,717 INFO L567 ElimStorePlain]: treesize reduction 24, result has 68.4 percent of original size [2019-11-16 00:01:36,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:01:36,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:52 [2019-11-16 00:01:36,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:01:36,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:01:36,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:01:36,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:01:36,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 150 [2019-11-16 00:01:36,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:36,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:01:36,966 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-16 00:01:36,966 INFO L341 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2019-11-16 00:01:36,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 259 [2019-11-16 00:01:36,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:36,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:01:37,117 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 47 [2019-11-16 00:01:37,118 INFO L567 ElimStorePlain]: treesize reduction 810, result has 14.9 percent of original size [2019-11-16 00:01:37,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:37,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:37,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-16 00:01:37,120 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:142 [2019-11-16 00:01:37,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:37,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:37,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:37,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:37,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:37,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:37,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:37,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:35,121 WARN L191 SmtUtils]: Spent 55.83 s on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-11-16 00:02:35,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:02:35,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:35,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:35,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:35,142 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:35,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 74 [2019-11-16 00:02:35,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:35,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,174 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:35,176 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,180 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,199 INFO L341 Elim1Store]: treesize reduction 18, result has 67.3 percent of original size [2019-11-16 00:02:35,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 119 [2019-11-16 00:02:35,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:35,214 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:35,217 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:35,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 65 [2019-11-16 00:02:35,240 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:35,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,248 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:35,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:35,274 INFO L341 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2019-11-16 00:02:35,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 117 [2019-11-16 00:02:35,276 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:35,508 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-11-16 00:02:35,508 INFO L567 ElimStorePlain]: treesize reduction 144, result has 68.5 percent of original size [2019-11-16 00:02:35,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-11-16 00:02:35,510 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:304, output treesize:313 [2019-11-16 00:03:09,912 WARN L191 SmtUtils]: Spent 32.29 s on a formula simplification that was a NOOP. DAG size: 66 [2019-11-16 00:03:09,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:03:44,080 WARN L191 SmtUtils]: Spent 32.14 s on a formula simplification that was a NOOP. DAG size: 62 [2019-11-16 00:03:44,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:03:44,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:44,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 109 [2019-11-16 00:03:44,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:44,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:44,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 117 [2019-11-16 00:03:44,246 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:44,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,342 INFO L341 Elim1Store]: treesize reduction 18, result has 81.3 percent of original size [2019-11-16 00:03:44,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 188 [2019-11-16 00:03:44,344 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:44,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:44,415 INFO L341 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2019-11-16 00:03:44,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 185 [2019-11-16 00:03:44,417 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:44,678 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 74 [2019-11-16 00:03:44,678 INFO L567 ElimStorePlain]: treesize reduction 365, result has 49.2 percent of original size [2019-11-16 00:03:44,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-11-16 00:03:44,680 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:381, output treesize:353 [2019-11-16 00:04:04,849 WARN L191 SmtUtils]: Spent 20.13 s on a formula simplification that was a NOOP. DAG size: 133 [2019-11-16 00:04:31,083 WARN L191 SmtUtils]: Spent 24.14 s on a formula simplification that was a NOOP. DAG size: 135 [2019-11-16 00:04:31,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:04:31,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:31,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:31,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:31,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:31,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201750328] [2019-11-16 00:04:31,152 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:04:31,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864477235] [2019-11-16 00:04:31,153 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:04:31,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-16 00:04:31,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802744236] [2019-11-16 00:04:31,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:04:31,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:31,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:04:31,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=85, Unknown=4, NotChecked=0, Total=110 [2019-11-16 00:04:31,155 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 11 states. [2019-11-16 00:04:41,376 WARN L191 SmtUtils]: Spent 10.08 s on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-11-16 00:04:51,499 WARN L191 SmtUtils]: Spent 10.08 s on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2019-11-16 00:05:01,719 WARN L191 SmtUtils]: Spent 10.12 s on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-11-16 00:05:25,948 WARN L191 SmtUtils]: Spent 20.16 s on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-11-16 00:05:36,405 WARN L191 SmtUtils]: Spent 8.35 s on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2019-11-16 00:06:00,723 WARN L191 SmtUtils]: Spent 22.23 s on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-11-16 00:06:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:06:37,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:37,725 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) 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.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:162) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:668) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:597) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 51 more [2019-11-16 00:06:37,730 INFO L168 Benchmark]: Toolchain (without parser) took 307821.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -81.6 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:37,730 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:37,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:37,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:37,731 INFO L168 Benchmark]: Boogie Preprocessor took 47.41 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-11-16 00:06:37,732 INFO L168 Benchmark]: RCFGBuilder took 279.75 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:37,732 INFO L168 Benchmark]: TraceAbstraction took 307098.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.6 MB). Peak memory consumption was 78.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:37,735 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.12 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 47.41 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 279.75 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 307098.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.6 MB). Peak memory consumption was 78.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) 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-11-16 00:06:40,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:06:40,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:06:40,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:06:40,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:06:40,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:06:40,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:06:40,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:06:40,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:06:40,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:06:40,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:06:40,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:06:40,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:06:40,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:06:40,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:06:40,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:06:40,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:06:40,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:06:40,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:06:40,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:06:40,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:06:40,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:06:40,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:06:40,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:06:40,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:06:40,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:06:40,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:06:40,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:06:40,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:06:40,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:06:40,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:06:40,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:06:40,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:06:40,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:06:40,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:06:40,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:06:40,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:06:40,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:06:40,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:06:40,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:06:40,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:06:40,166 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:06:40,181 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:06:40,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:06:40,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:06:40,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:06:40,183 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:06:40,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:06:40,184 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:06:40,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:06:40,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:06:40,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:06:40,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:06:40,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:06:40,186 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:06:40,186 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:06:40,186 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:06:40,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:06:40,187 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:06:40,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:06:40,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:06:40,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:06:40,188 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:06:40,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:06:40,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:06:40,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:06:40,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:06:40,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:06:40,190 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:06:40,190 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:06:40,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:06:40,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:06:40,191 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/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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 -> b294b69c7e36d528e963d4d19e42533f57ed2d99 [2019-11-16 00:06:40,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:06:40,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:06:40,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:06:40,288 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:06:40,289 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:06:40,290 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/../../sv-benchmarks/c/array-fpi/eqn1f.c [2019-11-16 00:06:40,353 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/data/ff56efb98/7dcdac16917543edb6aee484a6409c3a/FLAG66301190f [2019-11-16 00:06:40,824 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:06:40,825 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/sv-benchmarks/c/array-fpi/eqn1f.c [2019-11-16 00:06:40,833 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/data/ff56efb98/7dcdac16917543edb6aee484a6409c3a/FLAG66301190f [2019-11-16 00:06:41,142 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/bin/uautomizer/data/ff56efb98/7dcdac16917543edb6aee484a6409c3a [2019-11-16 00:06:41,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:06:41,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:06:41,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:41,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:06:41,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:06:41,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@705f37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41, skipping insertion in model container [2019-11-16 00:06:41,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,168 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:06:41,186 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:06:41,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:41,394 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:06:41,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:41,438 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:06:41,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41 WrapperNode [2019-11-16 00:06:41,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:41,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:41,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:06:41,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:06:41,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:41,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:06:41,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:06:41,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:06:41,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (1/1) ... [2019-11-16 00:06:41,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:06:41,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:06:41,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:06:41,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:06:41,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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-11-16 00:06:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-16 00:06:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:06:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:06:41,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:06:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-16 00:06:42,170 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:06:42,170 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:06:42,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:42 BoogieIcfgContainer [2019-11-16 00:06:42,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:06:42,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:06:42,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:06:42,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:06:42,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:06:41" (1/3) ... [2019-11-16 00:06:42,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65707302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:42, skipping insertion in model container [2019-11-16 00:06:42,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:41" (2/3) ... [2019-11-16 00:06:42,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65707302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:42, skipping insertion in model container [2019-11-16 00:06:42,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:42" (3/3) ... [2019-11-16 00:06:42,181 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn1f.c [2019-11-16 00:06:42,193 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:06:42,211 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:06:42,224 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:06:42,245 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:06:42,245 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:06:42,245 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:06:42,246 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:06:42,246 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:06:42,246 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:06:42,247 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:06:42,247 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:06:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-16 00:06:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:06:42,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:42,266 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:42,268 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1486647931, now seen corresponding path program 1 times [2019-11-16 00:06:42,283 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:06:42,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1661489896] [2019-11-16 00:06:42,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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-11-16 00:06:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:42,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-16 00:06:42,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:42,458 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:06:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:42,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1661489896] [2019-11-16 00:06:42,464 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:42,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:06:42,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349204513] [2019-11-16 00:06:42,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:06:42,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:06:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:06:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:06:42,487 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-16 00:06:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:42,504 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-16 00:06:42,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:06:42,505 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-16 00:06:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:42,514 INFO L225 Difference]: With dead ends: 33 [2019-11-16 00:06:42,515 INFO L226 Difference]: Without dead ends: 15 [2019-11-16 00:06:42,518 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-11-16 00:06:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-16 00:06:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-16 00:06:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:06:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-16 00:06:42,555 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-11-16 00:06:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:42,555 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-16 00:06:42,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:06:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-16 00:06:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:06:42,556 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:42,556 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:42,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:06:42,757 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1772723449, now seen corresponding path program 1 times [2019-11-16 00:06:42,758 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:06:42,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [283983682] [2019-11-16 00:06:42,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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-11-16 00:06:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:42,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:06:42,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:42,955 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:06:42,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:43,089 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 19 [2019-11-16 00:06:43,089 INFO L341 Elim1Store]: treesize reduction 68, result has 25.3 percent of original size [2019-11-16 00:06:43,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 43 [2019-11-16 00:06:43,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:43,160 INFO L567 ElimStorePlain]: treesize reduction 11, result has 76.1 percent of original size [2019-11-16 00:06:43,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:06:43,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:35 [2019-11-16 00:06:43,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:43,318 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:06:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:43,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [283983682] [2019-11-16 00:06:43,558 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:43,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-16 00:06:43,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416931232] [2019-11-16 00:06:43,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:06:43,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:06:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:06:43,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:43,562 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2019-11-16 00:06:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:44,115 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-16 00:06:44,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:06:44,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-16 00:06:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:44,121 INFO L225 Difference]: With dead ends: 22 [2019-11-16 00:06:44,121 INFO L226 Difference]: Without dead ends: 20 [2019-11-16 00:06:44,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:06:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-16 00:06:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-16 00:06:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:06:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-16 00:06:44,129 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2019-11-16 00:06:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:44,129 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-16 00:06:44,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:06:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-16 00:06:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:06:44,133 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:44,133 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:44,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:06:44,337 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash 437833903, now seen corresponding path program 1 times [2019-11-16 00:06:44,339 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:06:44,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1886899305] [2019-11-16 00:06:44,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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-11-16 00:06:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:44,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:06:44,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:44,610 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:06:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:44,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1886899305] [2019-11-16 00:06:44,738 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:44,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-16 00:06:44,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174208316] [2019-11-16 00:06:44,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:06:44,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:06:44,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:06:44,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:06:44,741 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 10 states. [2019-11-16 00:06:45,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:45,173 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-11-16 00:06:45,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:06:45,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-11-16 00:06:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:45,178 INFO L225 Difference]: With dead ends: 45 [2019-11-16 00:06:45,178 INFO L226 Difference]: Without dead ends: 20 [2019-11-16 00:06:45,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:06:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-16 00:06:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-16 00:06:45,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:06:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-11-16 00:06:45,186 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-11-16 00:06:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:45,187 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-16 00:06:45,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:06:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-11-16 00:06:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:06:45,189 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:45,189 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:45,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:06:45,394 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:45,395 INFO L82 PathProgramCache]: Analyzing trace with hash 575675563, now seen corresponding path program 1 times [2019-11-16 00:06:45,395 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:06:45,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1027313559] [2019-11-16 00:06:45,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa511450-3e7d-4186-9b27-2474988404ad/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-11-16 00:06:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:45,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:06:45,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:45,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:45,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-16 00:06:45,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:45,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:45,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:45,897 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:06:45,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:45,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:45,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:45,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:06:45,934 INFO L341 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2019-11-16 00:06:45,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 55 [2019-11-16 00:06:45,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:45,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:45,958 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2019-11-16 00:06:45,958 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:45,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:45,996 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:46,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:46,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:46,016 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:119, output treesize:41 [2019-11-16 00:06:46,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:06:46,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:46,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 79 [2019-11-16 00:06:46,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:46,177 INFO L567 ElimStorePlain]: treesize reduction 32, result has 66.3 percent of original size [2019-11-16 00:06:46,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:46,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-11-16 00:06:46,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:06:46,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:46,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:06:46,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:46,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 127 treesize of output 140 [2019-11-16 00:06:46,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:46,521 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-11-16 00:06:46,521 INFO L567 ElimStorePlain]: treesize reduction 63, result has 64.0 percent of original size [2019-11-16 00:06:46,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:06:46,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:130, output treesize:112 [2019-11-16 00:06:46,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:46,893 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:06:50,182 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-16 00:06:51,830 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:06:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:51,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1027313559] [2019-11-16 00:06:51,857 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:51,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-16 00:06:51,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764438906] [2019-11-16 00:06:51,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:06:51,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:06:51,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:06:51,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2019-11-16 00:06:51,859 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 16 states. [2019-11-16 00:07:13,413 WARN L191 SmtUtils]: Spent 20.75 s on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-11-16 00:07:24,094 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-16 00:07:26,648 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-16 00:07:45,284 WARN L191 SmtUtils]: Spent 6.37 s on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-11-16 00:07:46,782 WARN L191 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 62 [2019-11-16 00:07:51,044 WARN L191 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2019-11-16 00:07:54,858 WARN L191 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 128 DAG size of output: 62 [2019-11-16 00:07:56,703 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 135 DAG size of output: 66 [2019-11-16 00:07:58,248 WARN L191 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 66 [2019-11-16 00:08:01,787 WARN L191 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2019-11-16 00:08:05,406 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 123 DAG size of output: 66 [2019-11-16 00:08:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:05,498 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-11-16 00:08:05,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:08:05,500 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-11-16 00:08:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:05,500 INFO L225 Difference]: With dead ends: 28 [2019-11-16 00:08:05,500 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:08:05,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=164, Invalid=531, Unknown=7, NotChecked=0, Total=702 [2019-11-16 00:08:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:08:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:08:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:08:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:08:05,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-16 00:08:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:05,502 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:08:05,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:08:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:08:05,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:08:05,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:08:05,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:08:06,674 WARN L191 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-11-16 00:08:08,200 WARN L191 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2019-11-16 00:08:17,369 WARN L191 SmtUtils]: Spent 9.17 s on a formula simplification that was a NOOP. DAG size: 117 [2019-11-16 00:08:17,371 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-16 00:08:17,372 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:08:17,372 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:08:17,372 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:08:17,372 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 28 31) no Hoare annotation was computed. [2019-11-16 00:08:17,373 INFO L439 ceAbstractionStarter]: At program point L28-3(lines 28 31) the Hoare annotation is: (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (.cse28 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32))) (.cse8 (select |#memory_int| ULTIMATE.start_main_~b~0.base)) (.cse29 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))) (let ((.cse11 (select .cse8 .cse29)) (.cse17 (select .cse15 .cse28)) (.cse30 ((_ sign_extend 32) (_ bv1 32))) (.cse12 (select .cse8 ULTIMATE.start_main_~b~0.offset))) (let ((.cse0 (= ((_ extract 31 0) .cse30) .cse12)) (.cse1 (= .cse17 ((_ extract 63 32) ((_ sign_extend 32) (_ bv2 32))))) (.cse2 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse3 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse7 ((_ sign_extend 32) (_ bv3 32))) (.cse6 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32))) (.cse10 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) (.cse16 ((_ sign_extend 32) (_ bv20 32))) (.cse14 (= ((_ extract 63 32) .cse30) .cse11))) (or (let ((.cse13 (concat .cse17 (select .cse15 ULTIMATE.start_main_~a~0.offset)))) (and .cse0 .cse1 .cse2 .cse3 (let ((.cse9 (bvadd (concat .cse11 .cse12) .cse13))) (let ((.cse4 ((_ extract 63 32) .cse9))) (let ((.cse5 (store .cse8 .cse10 .cse4))) (or (= (concat .cse4 (select .cse5 .cse6)) .cse7) (not (= (store |#memory_int| ULTIMATE.start_main_~b~0.base .cse5) (store |#memory_int| ULTIMATE.start_main_~b~0.base (store .cse8 .cse6 ((_ extract 31 0) .cse9))))))))) .cse14 (= (select .cse15 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd .cse16 .cse13))))) (let ((.cse19 (bvmul ULTIMATE.start_main_~i~0 (_ bv8 32)))) (let ((.cse21 (concat (select .cse15 (bvadd ULTIMATE.start_main_~a~0.offset .cse19 (_ bv4294967292 32))) (select .cse15 (bvadd ULTIMATE.start_main_~a~0.offset .cse19 (_ bv4294967288 32)))))) (and .cse0 .cse1 .cse2 .cse3 (let ((.cse20 (bvadd (concat (select .cse8 (bvadd .cse19 ULTIMATE.start_main_~b~0.offset (_ bv4294967292 32))) (select .cse8 (bvadd .cse19 ULTIMATE.start_main_~b~0.offset (_ bv4294967288 32)))) .cse21))) (let ((.cse18 (store .cse8 (bvadd .cse19 ULTIMATE.start_main_~b~0.offset (_ bv4 32)) ((_ extract 63 32) .cse20)))) (or (= .cse7 (concat (select .cse18 .cse10) (select .cse18 .cse6))) (not (= (store |#memory_int| ULTIMATE.start_main_~b~0.base .cse18) (store |#memory_int| ULTIMATE.start_main_~b~0.base (store .cse8 (bvadd .cse19 ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) .cse20)))))))) (not (bvsle ~N~0 (_ bv0 32))) (let ((.cse27 (store .cse15 (bvadd ULTIMATE.start_main_~a~0.offset .cse19) ((_ extract 31 0) (bvadd .cse16 .cse21))))) (let ((.cse24 (store |#memory_int| ULTIMATE.start_main_~a~0.base .cse27))) (let ((.cse25 (select .cse24 ULTIMATE.start_main_~b~0.base))) (let ((.cse26 (bvadd (concat (select .cse27 .cse28) (select .cse27 ULTIMATE.start_main_~a~0.offset)) (concat (select .cse25 .cse29) (select .cse25 ULTIMATE.start_main_~b~0.offset))))) (let ((.cse22 ((_ extract 63 32) .cse26))) (let ((.cse23 (store .cse25 .cse10 .cse22))) (or (= .cse7 (concat .cse22 (select .cse23 .cse6))) (not (= (store .cse24 ULTIMATE.start_main_~b~0.base (store .cse25 .cse6 ((_ extract 31 0) .cse26))) (store .cse24 ULTIMATE.start_main_~b~0.base .cse23)))))))))) .cse14 (= (_ bv1 32) ULTIMATE.start_main_~i~0)))))))) [2019-11-16 00:08:17,373 INFO L443 ceAbstractionStarter]: For program point L28-4(lines 28 31) no Hoare annotation was computed. [2019-11-16 00:08:17,373 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:08:17,373 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:08:17,373 INFO L443 ceAbstractionStarter]: For program point L33-2(lines 33 36) no Hoare annotation was computed. [2019-11-16 00:08:17,374 INFO L439 ceAbstractionStarter]: At program point L33-3(lines 33 36) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse15 (select .cse14 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32)))) (.cse16 ((_ sign_extend 32) (_ bv1 32))) (.cse4 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse0 (= ((_ extract 31 0) .cse16) (select .cse4 ULTIMATE.start_main_~b~0.offset))) (.cse1 (= .cse15 ((_ extract 63 32) ((_ sign_extend 32) (_ bv2 32))))) (.cse2 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse3 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse11 (= ((_ extract 63 32) .cse16) (select .cse4 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))))) (.cse5 (= (select .cse14 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv20 32)) (concat .cse15 (select .cse14 ULTIMATE.start_main_~a~0.offset))))))) (or (and .cse0 .cse1 .cse2 .cse3 (= ((_ sign_extend 32) (_ bv3 32)) (concat (select .cse4 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) (select .cse4 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32))))) .cse5 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse8 ((_ extract 63 32) ((_ sign_extend 32) (_ bv2 32)))) (.cse6 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse7 (concat .cse8 (select .cse6 (_ bv0 32)))) (.cse10 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse9 (bvadd .cse7 (concat (select .cse10 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))))))) (and (= (select .cse6 (_ bv8 32)) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv20 32)) .cse7))) (= (select .cse6 (_ bv4 32)) .cse8) (= ((_ extract 31 0) .cse9) (select .cse10 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32)))) (= (select .cse10 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) .cse9)))))))) (and .cse0 .cse3 (not (bvslt (_ bv1 32) ~N~0)) (not (bvsle ~N~0 (_ bv0 32))) .cse11 (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse3 (not (let ((.cse12 (bvmul ULTIMATE.start_main_~i~0 (_ bv8 32)))) (let ((.cse13 (bvadd (concat (select .cse4 (bvadd .cse12 ULTIMATE.start_main_~b~0.offset (_ bv4294967292 32))) (select .cse4 (bvadd .cse12 ULTIMATE.start_main_~b~0.offset (_ bv4294967288 32)))) (concat (select .cse14 (bvadd ULTIMATE.start_main_~a~0.offset .cse12 (_ bv4294967292 32))) (select .cse14 (bvadd ULTIMATE.start_main_~a~0.offset .cse12 (_ bv4294967288 32))))))) (= (store |#memory_int| ULTIMATE.start_main_~b~0.base (store .cse4 (bvadd .cse12 ULTIMATE.start_main_~b~0.offset (_ bv4 32)) ((_ extract 63 32) .cse13))) (store |#memory_int| ULTIMATE.start_main_~b~0.base (store .cse4 (bvadd .cse12 ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) .cse13))))))) .cse11 .cse5 (= (_ bv1 32) ULTIMATE.start_main_~i~0)))))) [2019-11-16 00:08:17,374 INFO L443 ceAbstractionStarter]: For program point L33-4(lines 33 36) no Hoare annotation was computed. [2019-11-16 00:08:17,374 INFO L446 ceAbstractionStarter]: At program point L42(lines 16 43) the Hoare annotation is: true [2019-11-16 00:08:17,374 INFO L443 ceAbstractionStarter]: For program point L38-2(lines 38 41) no Hoare annotation was computed. [2019-11-16 00:08:17,375 INFO L439 ceAbstractionStarter]: At program point L38-3(lines 38 41) the Hoare annotation is: (let ((.cse18 ((_ sign_extend 32) (_ bv1 32))) (.cse17 (select |#memory_int| ULTIMATE.start_main_~b~0.base)) (.cse15 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse16 (select .cse15 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32)))) (.cse6 (= ((_ extract 31 0) .cse18) (select .cse17 ULTIMATE.start_main_~b~0.offset))) (.cse7 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse9 (= ((_ extract 63 32) .cse18) (select .cse17 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))))) (let ((.cse3 (and .cse6 .cse7 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) .cse9)) (.cse0 (= .cse16 ((_ extract 63 32) ((_ sign_extend 32) (_ bv2 32))))) (.cse1 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse8 (= (_ bv0 32) ULTIMATE.start_main_~i~0)) (.cse2 (= ((_ sign_extend 32) (_ bv3 32)) (concat (select .cse17 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) (select .cse17 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32)))))) (.cse4 (= (select .cse15 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv20 32)) (concat .cse16 (select .cse15 ULTIMATE.start_main_~a~0.offset)))))) (.cse5 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse12 ((_ extract 63 32) ((_ sign_extend 32) (_ bv2 32)))) (.cse10 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse11 (concat .cse12 (select .cse10 (_ bv0 32)))) (.cse14 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse13 (bvadd .cse11 (concat (select .cse14 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))))))) (and (= (select .cse10 (_ bv8 32)) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv20 32)) .cse11))) (= (select .cse10 (_ bv4 32)) .cse12) (= ((_ extract 31 0) .cse13) (select .cse14 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32)))) (= (select .cse14 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) .cse13))))))))) (or (and .cse0 .cse1 .cse2 (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) .cse3 .cse4 .cse5) (and (not (bvslt (_ bv1 32) ~N~0)) (not (bvslt ULTIMATE.start_main_~i~0 ~N~0)) .cse3) (and .cse6 .cse7 .cse8 .cse9 (not (bvslt (bvadd ULTIMATE.start_main_~i~0 (_ bv1 32)) ~N~0))) (and .cse6 .cse0 .cse1 .cse7 .cse8 .cse2 .cse4 .cse5))))) [2019-11-16 00:08:17,375 INFO L443 ceAbstractionStarter]: For program point L38-4(lines 38 41) no Hoare annotation was computed. [2019-11-16 00:08:17,375 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-16 00:08:17,375 INFO L443 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-16 00:08:17,375 INFO L443 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-16 00:08:17,382 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) 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-11-16 00:08:17,387 INFO L168 Benchmark]: Toolchain (without parser) took 96239.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -63.5 MB). Peak memory consumption was 138.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:17,387 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:08:17,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:17,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:17,389 INFO L168 Benchmark]: Boogie Preprocessor took 36.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:08:17,390 INFO L168 Benchmark]: RCFGBuilder took 576.69 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:17,391 INFO L168 Benchmark]: TraceAbstraction took 95211.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.8 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:17,394 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.62 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 576.69 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 95211.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.8 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...