./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/heap-data/shared_mem2_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/shared_mem2_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/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 ebbfaff6f87d2f170bbf62930cb63938c92c4b2b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:17:07,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:17:07,465 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:17:07,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:17:07,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:17:07,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:17:07,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:17:07,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:17:07,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:17:07,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:17:07,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:17:07,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:17:07,478 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:17:07,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:17:07,479 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:17:07,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:17:07,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:17:07,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:17:07,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:17:07,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:17:07,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:17:07,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:17:07,486 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:17:07,486 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:17:07,487 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:17:07,487 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:17:07,488 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:17:07,488 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:17:07,489 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:17:07,489 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:17:07,490 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:17:07,490 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:17:07,490 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:17:07,490 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:17:07,491 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:17:07,491 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:17:07,492 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 07:17:07,501 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:17:07,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:17:07,502 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:17:07,502 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:17:07,502 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:17:07,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:17:07,503 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:17:07,503 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:17:07,503 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:17:07,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:17:07,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:17:07,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:17:07,503 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:17:07,504 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:17:07,504 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:17:07,504 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:17:07,504 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:17:07,504 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:17:07,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:17:07,504 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:17:07,504 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:17:07,505 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:17:07,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:17:07,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:17:07,505 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:17:07,505 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:17:07,505 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:17:07,505 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:17:07,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:17:07,506 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/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 -> ebbfaff6f87d2f170bbf62930cb63938c92c4b2b [2018-11-10 07:17:07,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:17:07,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:17:07,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:17:07,539 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:17:07,539 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:17:07,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/../../sv-benchmarks/c/heap-data/shared_mem2_true-unreach-call.i [2018-11-10 07:17:07,576 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/data/fca4bef41/823857d3110045c98f8d4b663c35b05b/FLAG05252c421 [2018-11-10 07:17:08,004 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:17:08,005 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/sv-benchmarks/c/heap-data/shared_mem2_true-unreach-call.i [2018-11-10 07:17:08,013 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/data/fca4bef41/823857d3110045c98f8d4b663c35b05b/FLAG05252c421 [2018-11-10 07:17:08,021 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/data/fca4bef41/823857d3110045c98f8d4b663c35b05b [2018-11-10 07:17:08,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:17:08,024 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:17:08,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:17:08,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:17:08,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:17:08,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:17:08" (1/1) ... [2018-11-10 07:17:08,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff1ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08, skipping insertion in model container [2018-11-10 07:17:08,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:17:08" (1/1) ... [2018-11-10 07:17:08,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:17:08,058 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:17:08,224 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:17:08,232 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:17:08,258 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:17:08,287 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:17:08,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08 WrapperNode [2018-11-10 07:17:08,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:17:08,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:17:08,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:17:08,289 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:17:08,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08" (1/1) ... [2018-11-10 07:17:08,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08" (1/1) ... [2018-11-10 07:17:08,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08" (1/1) ... [2018-11-10 07:17:08,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08" (1/1) ... [2018-11-10 07:17:08,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08" (1/1) ... [2018-11-10 07:17:08,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08" (1/1) ... [2018-11-10 07:17:08,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08" (1/1) ... [2018-11-10 07:17:08,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:17:08,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:17:08,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:17:08,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:17:08,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/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 [2018-11-10 07:17:08,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:17:08,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:17:08,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-10 07:17:08,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-10 07:17:08,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:17:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 07:17:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 07:17:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 07:17:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 07:17:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 07:17:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 07:17:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 07:17:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 07:17:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 07:17:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 07:17:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 07:17:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 07:17:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 07:17:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 07:17:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 07:17:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 07:17:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 07:17:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 07:17:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 07:17:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 07:17:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 07:17:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 07:17:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 07:17:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 07:17:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 07:17:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 07:17:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 07:17:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 07:17:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 07:17:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 07:17:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 07:17:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 07:17:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 07:17:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 07:17:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 07:17:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 07:17:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 07:17:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 07:17:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 07:17:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 07:17:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 07:17:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 07:17:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 07:17:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 07:17:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 07:17:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 07:17:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 07:17:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 07:17:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 07:17:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 07:17:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 07:17:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 07:17:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 07:17:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 07:17:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 07:17:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 07:17:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 07:17:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 07:17:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 07:17:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 07:17:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 07:17:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 07:17:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 07:17:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 07:17:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 07:17:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 07:17:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 07:17:08,646 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:17:08,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:17:08 BoogieIcfgContainer [2018-11-10 07:17:08,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:17:08,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:17:08,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:17:08,649 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:17:08,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:17:08" (1/3) ... [2018-11-10 07:17:08,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6681f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:17:08, skipping insertion in model container [2018-11-10 07:17:08,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:08" (2/3) ... [2018-11-10 07:17:08,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6681f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:17:08, skipping insertion in model container [2018-11-10 07:17:08,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:17:08" (3/3) ... [2018-11-10 07:17:08,652 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2_true-unreach-call.i [2018-11-10 07:17:08,657 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:17:08,662 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:17:08,672 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:17:08,696 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:17:08,697 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:17:08,697 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:17:08,697 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:17:08,697 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:17:08,697 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:17:08,697 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:17:08,697 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:17:08,697 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:17:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-10 07:17:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:17:08,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:08,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:17:08,718 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:08,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2029667671, now seen corresponding path program 1 times [2018-11-10 07:17:08,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:08,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:08,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:08,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:08,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:17:08,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:08,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:17:08,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 07:17:08,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:17:08,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:17:08,841 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2018-11-10 07:17:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:08,856 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-10 07:17:08,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:17:08,857 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-10 07:17:08,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:08,863 INFO L225 Difference]: With dead ends: 70 [2018-11-10 07:17:08,863 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 07:17:08,865 INFO L605 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 [2018-11-10 07:17:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 07:17:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-10 07:17:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 07:17:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-10 07:17:08,889 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2018-11-10 07:17:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:08,889 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-10 07:17:08,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 07:17:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-10 07:17:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:17:08,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:08,890 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:17:08,890 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:08,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1519045343, now seen corresponding path program 1 times [2018-11-10 07:17:08,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:08,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:08,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:08,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:08,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:17:09,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:09,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 07:17:09,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 07:17:09,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:17:09,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:17:09,043 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 9 states. [2018-11-10 07:17:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:09,201 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-11-10 07:17:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:17:09,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-10 07:17:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:09,202 INFO L225 Difference]: With dead ends: 68 [2018-11-10 07:17:09,202 INFO L226 Difference]: Without dead ends: 64 [2018-11-10 07:17:09,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:17:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-10 07:17:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-11-10 07:17:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 07:17:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-11-10 07:17:09,209 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 24 [2018-11-10 07:17:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:09,210 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-10 07:17:09,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 07:17:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-11-10 07:17:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:17:09,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:09,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:17:09,211 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:09,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:09,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1754522329, now seen corresponding path program 1 times [2018-11-10 07:17:09,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:09,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:09,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:09,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:09,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:17:09,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:17:09,452 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:17:09,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:09,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:17:09,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 07:17:09,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 07:17:09,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 07:17:09,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 07:17:09,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 07:17:09,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:09,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:09,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 07:17:09,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2018-11-10 07:17:09,686 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 07:17:09,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 07:17:09,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,704 INFO L267 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. [2018-11-10 07:17:09,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2018-11-10 07:17:09,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:09,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:09,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:09,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 07:17:09,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 07:17:09,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-11-10 07:17:09,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-10 07:17:09,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 07:17:09,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:09,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 07:17:09,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:38, output treesize:19 [2018-11-10 07:17:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:17:09,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:17:09,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-11-10 07:17:09,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 07:17:09,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 07:17:09,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-11-10 07:17:09,918 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 24 states. [2018-11-10 07:17:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:10,995 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2018-11-10 07:17:10,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 07:17:10,995 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-11-10 07:17:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:10,997 INFO L225 Difference]: With dead ends: 150 [2018-11-10 07:17:10,997 INFO L226 Difference]: Without dead ends: 146 [2018-11-10 07:17:10,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 07:17:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-10 07:17:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 77. [2018-11-10 07:17:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 07:17:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-10 07:17:11,004 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 34 [2018-11-10 07:17:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:11,005 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-10 07:17:11,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 07:17:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-11-10 07:17:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:17:11,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:11,006 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:17:11,006 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:11,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1388873817, now seen corresponding path program 1 times [2018-11-10 07:17:11,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:11,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:11,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:11,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:11,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:17:11,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:17:11,216 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:17:11,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:11,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:17:11,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 07:17:11,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 07:17:11,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 07:17:11,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 07:17:11,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-10 07:17:11,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 07:17:11,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:11,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 07:17:11,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 07:17:11,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:11,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 07:17:11,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-11-10 07:17:11,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-11-10 07:17:11,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:11,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2018-11-10 07:17:11,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-10 07:17:11,449 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:11,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 25 [2018-11-10 07:17:11,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:20 [2018-11-10 07:17:11,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-11-10 07:17:11,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-10 07:17:11,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2018-11-10 07:17:11,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 07:17:11,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:17:11,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,644 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:7 [2018-11-10 07:17:11,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 07:17:11,708 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-10 07:17:11,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:11,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-10 07:17:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:17:11,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:17:11,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-11-10 07:17:11,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-10 07:17:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 07:17:11,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-11-10 07:17:11,762 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 28 states. [2018-11-10 07:17:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:12,909 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2018-11-10 07:17:12,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 07:17:12,910 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2018-11-10 07:17:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:12,911 INFO L225 Difference]: With dead ends: 142 [2018-11-10 07:17:12,911 INFO L226 Difference]: Without dead ends: 138 [2018-11-10 07:17:12,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=531, Invalid=2019, Unknown=0, NotChecked=0, Total=2550 [2018-11-10 07:17:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-10 07:17:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 90. [2018-11-10 07:17:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 07:17:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2018-11-10 07:17:12,920 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 38 [2018-11-10 07:17:12,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:12,920 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2018-11-10 07:17:12,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-10 07:17:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-11-10 07:17:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 07:17:12,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:12,922 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:17:12,922 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:12,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash 142123287, now seen corresponding path program 1 times [2018-11-10 07:17:12,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:12,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:12,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 07:17:13,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:17:13,248 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:17:13,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:13,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:17:13,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 07:17:13,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 07:17:13,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 07:17:13,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 07:17:13,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 07:17:13,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 07:17:13,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 07:17:13,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-11-10 07:17:13,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 07:17:13,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:13,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 07:17:13,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 07:17:13,351 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:13,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 07:17:13,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-11-10 07:17:13,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-10 07:17:13,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:13,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2018-11-10 07:17:13,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 07:17:13,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:17:13,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-10 07:17:13,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,479 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:63, output treesize:15 [2018-11-10 07:17:13,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-10 07:17:13,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 18 [2018-11-10 07:17:13,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 07:17:13,550 INFO L477 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 25 treesize of output 21 [2018-11-10 07:17:13,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,561 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-10 07:17:13,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:13,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:17:13,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:17:13,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:29, output treesize:15 [2018-11-10 07:17:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 07:17:13,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:17:13,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [19] total 28 [2018-11-10 07:17:13,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-10 07:17:13,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 07:17:13,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-11-10 07:17:13,619 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 28 states. [2018-11-10 07:17:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:14,633 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-10 07:17:14,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 07:17:14,633 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-11-10 07:17:14,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:14,634 INFO L225 Difference]: With dead ends: 130 [2018-11-10 07:17:14,634 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 07:17:14,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=385, Invalid=1595, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 07:17:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 07:17:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2018-11-10 07:17:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 07:17:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-11-10 07:17:14,642 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 47 [2018-11-10 07:17:14,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:14,642 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-11-10 07:17:14,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-10 07:17:14,642 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-11-10 07:17:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 07:17:14,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:14,643 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:17:14,643 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:14,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash -636015633, now seen corresponding path program 1 times [2018-11-10 07:17:14,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:14,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:14,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:14,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:14,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:17:14,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:17:14,973 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:17:14,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:14,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:17:15,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-10 07:17:15,149 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-11-10 07:17:15,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:15,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:15,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-10 07:17:15,159 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-10 07:17:15,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:15,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:15,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:15,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2018-11-10 07:17:15,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 69 [2018-11-10 07:17:15,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-11-10 07:17:15,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:15,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 58 [2018-11-10 07:17:15,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 07:17:15,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 68 [2018-11-10 07:17:15,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 9 xjuncts. [2018-11-10 07:17:15,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2018-11-10 07:17:15,634 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 07:17:15,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-10 07:17:15,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-11-10 07:17:15,799 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:48, output treesize:130 [2018-11-10 07:17:15,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 07:17:15,867 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-10 07:17:15,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:17:15,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:15,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:17:15,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-10 07:17:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 07:17:15,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:17:15,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2018-11-10 07:17:15,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-10 07:17:15,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 07:17:15,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-11-10 07:17:15,907 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 32 states. [2018-11-10 07:17:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:17,859 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2018-11-10 07:17:17,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-10 07:17:17,859 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 48 [2018-11-10 07:17:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:17,859 INFO L225 Difference]: With dead ends: 142 [2018-11-10 07:17:17,859 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:17:17,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1171, Invalid=4991, Unknown=0, NotChecked=0, Total=6162 [2018-11-10 07:17:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:17:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:17:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:17:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:17:17,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-11-10 07:17:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:17,861 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:17:17,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-10 07:17:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:17:17,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:17:17,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:17:17,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:17:17,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:17:17,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:17:17,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:17:17,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:17:17,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:17:18,057 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2018-11-10 07:17:18,146 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:17:18,146 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:17:18,146 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:17:18,146 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2018-11-10 07:17:18,146 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2018-11-10 07:17:18,146 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:17:18,147 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point L576(line 576) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 565 591) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point L589(lines 589 590) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point L589-2(lines 565 591) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point L585(line 585) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point L585-1(line 585) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point L585-2(line 585) no Hoare annotation was computed. [2018-11-10 07:17:18,147 INFO L425 ceAbstractionStarter]: For program point L585-3(lines 585 586) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L585-5(lines 585 586) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L577-1(line 577) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 573 582) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L573-2(lines 573 582) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L573-4(lines 573 582) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L569-1(line 569) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L586-1(line 586) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L586-2(line 586) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L586-3(line 586) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L586-4(line 586) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L578(line 578) no Hoare annotation was computed. [2018-11-10 07:17:18,148 INFO L425 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-11-10 07:17:18,149 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-10 07:17:18,149 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 590) no Hoare annotation was computed. [2018-11-10 07:17:18,149 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-10 07:17:18,150 INFO L425 ceAbstractionStarter]: For program point L579(line 579) no Hoare annotation was computed. [2018-11-10 07:17:18,150 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2018-11-10 07:17:18,150 INFO L421 ceAbstractionStarter]: At program point L575-1(lines 573 582) the Hoare annotation is: (let ((.cse0 (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset))) (.cse1 (= 0 |main_#t~malloc2.offset|)) (.cse2 (= main_~m~0.offset 0)) (.cse3 (not (= main_~m~0.base main_~head~0.base))) (.cse4 (= (select |#valid| main_~head~0.base) 1)) (.cse5 (= (select |#valid| |main_#t~malloc3.base|) 1)) (.cse6 (= (select |#valid| main_~m~0.base) 1)) (.cse7 (= (select |#valid| |main_#t~malloc2.base|) 1)) (.cse8 (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= main_~m~0.base |main_#t~malloc3.base|)) (not (= main_~head~0.base main_~n~0.base)) (not (= main_~m~0.base main_~n~0.base)) .cse5 (not (= main_~m~0.base |main_#t~malloc6.base|)) (not (= main_~head~0.base |main_#t~malloc6.base|)) .cse6 .cse7 .cse8) (let ((.cse11 (select |#memory_$Pointer$.base| main_~head~0.base)) (.cse10 (+ main_~head~0.offset 4)) (.cse9 (select |#memory_$Pointer$.offset| main_~head~0.base)) (.cse12 (+ main_~head~0.offset 8)) (.cse15 (select |#memory_$Pointer$.base| main_~list~0.base)) (.cse14 (+ main_~list~0.offset 8)) (.cse13 (select |#memory_$Pointer$.offset| main_~list~0.base)) (.cse16 (+ main_~list~0.offset 4))) (and (= main_~m~0.offset (select .cse9 .cse10)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= (select .cse11 .cse12) main_~head~0.base) (= main_~m~0.base (select .cse11 .cse10)) .cse0 (= main_~list~0.offset (select .cse13 .cse14)) .cse1 .cse2 .cse3 .cse4 (not (= |main_#t~malloc3.base| main_~m~0.base)) (= main_~m~0.base (select .cse15 .cse16)) .cse5 (= (select .cse9 .cse12) main_~head~0.offset) .cse6 (= main_~list~0.base (select .cse15 .cse14)) (= (select .cse13 .cse16) main_~m~0.offset) .cse7 .cse8)))) [2018-11-10 07:17:18,150 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 565 591) the Hoare annotation is: true [2018-11-10 07:17:18,150 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-10 07:17:18,150 INFO L425 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-11-10 07:17:18,150 INFO L425 ceAbstractionStarter]: For program point L567-1(line 567) no Hoare annotation was computed. [2018-11-10 07:17:18,151 INFO L425 ceAbstractionStarter]: For program point L584-1(lines 584 588) no Hoare annotation was computed. [2018-11-10 07:17:18,151 INFO L425 ceAbstractionStarter]: For program point L584-2(lines 584 588) no Hoare annotation was computed. [2018-11-10 07:17:18,151 INFO L421 ceAbstractionStarter]: At program point L584-4(lines 584 588) the Hoare annotation is: (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (= 0 |main_#t~malloc2.offset|) (= (select |#valid| main_~m~0.base) 1) (= main_~m~0.offset 0) (= (select |#valid| |main_#t~malloc2.base|) 1)) [2018-11-10 07:17:18,151 INFO L425 ceAbstractionStarter]: For program point L584-5(lines 584 588) no Hoare annotation was computed. [2018-11-10 07:17:18,161 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,162 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,162 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,162 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,163 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,163 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,163 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,163 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,165 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,165 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,165 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,165 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,167 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,167 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,167 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,167 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,167 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:17:18 BoogieIcfgContainer [2018-11-10 07:17:18,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:17:18,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:17:18,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:17:18,180 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:17:18,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:17:08" (3/4) ... [2018-11-10 07:17:18,187 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:17:18,193 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:17:18,193 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-10 07:17:18,193 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-10 07:17:18,193 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:17:18,197 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 07:17:18,197 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 07:17:18,197 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:17:18,234 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_faef14c7-571b-4ae7-ab5f-66d2708aef8e/bin-2019/uautomizer/witness.graphml [2018-11-10 07:17:18,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:17:18,235 INFO L168 Benchmark]: Toolchain (without parser) took 10211.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.2 MB). Free memory was 957.5 MB in the beginning and 934.4 MB in the end (delta: 23.2 MB). Peak memory consumption was 383.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:17:18,235 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:17:18,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.16 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 935.9 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:17:18,235 INFO L168 Benchmark]: Boogie Preprocessor took 72.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 935.9 MB in the beginning and 1.2 GB in the end (delta: -223.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:17:18,236 INFO L168 Benchmark]: RCFGBuilder took 285.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:17:18,236 INFO L168 Benchmark]: TraceAbstraction took 9531.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 934.4 MB in the end (delta: 175.2 MB). Peak memory consumption was 370.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:17:18,236 INFO L168 Benchmark]: Witness Printer took 54.56 ms. Allocated memory is still 1.4 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:17:18,241 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.16 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 935.9 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 935.9 MB in the beginning and 1.2 GB in the end (delta: -223.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 285.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9531.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 934.4 MB in the end (delta: 175.2 MB). Peak memory consumption was 370.7 MB. Max. memory is 11.5 GB. * Witness Printer took 54.56 ms. Allocated memory is still 1.4 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 590]: 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: 573]: Loop Invariant [2018-11-10 07:17:18,244 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,250 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,250 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,250 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,250 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,250 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,253 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,255 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,255 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 07:17:18,255 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 07:17:18,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 07:17:18,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((((((1 == unknown-#memory_int-unknown[head][head] && 0 == malloc(sizeof(*m))) && m == 0) && !(m == head)) && \valid[head] == 1) && !(m == malloc(sizeof(*head)))) && !(head == n)) && !(m == n)) && \valid[malloc(sizeof(*head))] == 1) && !(m == malloc(sizeof(*n)))) && !(head == malloc(sizeof(*n)))) && \valid[m] == 1) && \valid[malloc(sizeof(*m))] == 1) && 0 == unknown-#memory_int-unknown[m][m]) || ((((((((((((((((((m == #memory_$Pointer$[head][head + 4] && 1 == unknown-#memory_int-unknown[list][list]) && #memory_$Pointer$[head][head + 8] == head) && m == #memory_$Pointer$[head][head + 4]) && 1 == unknown-#memory_int-unknown[head][head]) && list == #memory_$Pointer$[list][list + 8]) && 0 == malloc(sizeof(*m))) && m == 0) && !(m == head)) && \valid[head] == 1) && !(malloc(sizeof(*head)) == m)) && m == #memory_$Pointer$[list][list + 4]) && \valid[malloc(sizeof(*head))] == 1) && #memory_$Pointer$[head][head + 8] == head) && \valid[m] == 1) && list == #memory_$Pointer$[list][list + 8]) && #memory_$Pointer$[list][list + 4] == m) && \valid[malloc(sizeof(*m))] == 1) && 0 == unknown-#memory_int-unknown[m][m]) - InvariantResult [Line: 584]: Loop Invariant [2018-11-10 07:17:18,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:17:18,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((unknown-#memory_int-unknown[m][m] <= 100 && 0 == malloc(sizeof(*m))) && \valid[m] == 1) && m == 0) && \valid[malloc(sizeof(*m))] == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 53 locations, 1 error locations. SAFE Result, 9.4s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 2051 SDslu, 1755 SDs, 0 SdLazy, 2250 SolverSat, 446 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 137 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 17 NumberOfFragments, 222 HoareAnnotationTreeSize, 6 FomulaSimplifications, 5084 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 885 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 368 ConstructedInterpolants, 23 QuantifiedInterpolants, 185175 SizeOfPredicates, 47 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 27/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...