./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.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_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:27:55,581 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:27:55,582 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:27:55,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:27:55,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:27:55,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:27:55,591 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:27:55,593 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:27:55,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:27:55,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:27:55,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:27:55,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:27:55,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:27:55,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:27:55,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:27:55,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:27:55,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:27:55,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:27:55,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:27:55,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:27:55,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:27:55,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:27:55,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:27:55,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:27:55,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:27:55,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:27:55,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:27:55,608 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:27:55,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:27:55,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:27:55,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:27:55,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:27:55,610 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:27:55,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:27:55,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:27:55,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:27:55,612 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 05:27:55,622 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:27:55,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:27:55,622 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:27:55,622 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 05:27:55,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:27:55,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:27:55,623 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:27:55,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:27:55,624 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:27:55,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:27:55,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:27:55,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:27:55,624 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:27:55,624 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:27:55,624 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:27:55,624 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:27:55,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:27:55,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:27:55,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:27:55,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:27:55,625 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:27:55,625 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:27:55,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:27:55,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:27:55,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:27:55,626 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:27:55,626 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:27:55,626 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:27:55,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:27:55,626 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_fa4f160c-0365-49fb-a99d-a4d572394e13/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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-11-10 05:27:55,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:27:55,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:27:55,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:27:55,661 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:27:55,661 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:27:55,661 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-10 05:27:55,699 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/data/b3b6e06b5/f70d92da01204efabb8358b4673f6d96/FLAG3ab23e21d [2018-11-10 05:27:56,123 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:27:56,124 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-10 05:27:56,130 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/data/b3b6e06b5/f70d92da01204efabb8358b4673f6d96/FLAG3ab23e21d [2018-11-10 05:27:56,138 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/data/b3b6e06b5/f70d92da01204efabb8358b4673f6d96 [2018-11-10 05:27:56,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:27:56,141 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 05:27:56,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:27:56,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:27:56,145 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:27:56,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:56" (1/1) ... [2018-11-10 05:27:56,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e93ce52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56, skipping insertion in model container [2018-11-10 05:27:56,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:56" (1/1) ... [2018-11-10 05:27:56,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:27:56,187 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:27:56,369 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:27:56,375 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:27:56,406 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:27:56,437 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:27:56,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56 WrapperNode [2018-11-10 05:27:56,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:27:56,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:27:56,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:27:56,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:27:56,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56" (1/1) ... [2018-11-10 05:27:56,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56" (1/1) ... [2018-11-10 05:27:56,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56" (1/1) ... [2018-11-10 05:27:56,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56" (1/1) ... [2018-11-10 05:27:56,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56" (1/1) ... [2018-11-10 05:27:56,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56" (1/1) ... [2018-11-10 05:27:56,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56" (1/1) ... [2018-11-10 05:27:56,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:27:56,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:27:56,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:27:56,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:27:56,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/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 05:27:56,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:27:56,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:27:56,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:27:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 05:27:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 05:27:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 05:27:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 05:27:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 05:27:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 05:27:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 05:27:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 05:27:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 05:27:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 05:27:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 05:27:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 05:27:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 05:27:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 05:27:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 05:27:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 05:27:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 05:27:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 05:27:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 05:27:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 05:27:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 05:27:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 05:27:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 05:27:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 05:27:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 05:27:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 05:27:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 05:27:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 05:27:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 05:27:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 05:27:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 05:27:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 05:27:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 05:27:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 05:27:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 05:27:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 05:27:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 05:27:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 05:27:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 05:27:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 05:27:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 05:27:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 05:27:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 05:27:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 05:27:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 05:27:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 05:27:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 05:27:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 05:27:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 05:27:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 05:27:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 05:27:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 05:27:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 05:27:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 05:27:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 05:27:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 05:27:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 05:27:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 05:27:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 05:27:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 05:27:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 05:27:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 05:27:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 05:27:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 05:27:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 05:27:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 05:27:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 05:27:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 05:27:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 05:27:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 05:27:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 05:27:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 05:27:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 05:27:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 05:27:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 05:27:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 05:27:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 05:27:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 05:27:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 05:27:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 05:27:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 05:27:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 05:27:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 05:27:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 05:27:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 05:27:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 05:27:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 05:27:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 05:27:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 05:27:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 05:27:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 05:27:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 05:27:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 05:27:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 05:27:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:27:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 05:27:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 05:27:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 05:27:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 05:27:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:27:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:27:57,020 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:27:57,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:57 BoogieIcfgContainer [2018-11-10 05:27:57,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:27:57,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:27:57,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:27:57,024 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:27:57,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:27:56" (1/3) ... [2018-11-10 05:27:57,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d442573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:57, skipping insertion in model container [2018-11-10 05:27:57,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:56" (2/3) ... [2018-11-10 05:27:57,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d442573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:57, skipping insertion in model container [2018-11-10 05:27:57,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:57" (3/3) ... [2018-11-10 05:27:57,026 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-11-10 05:27:57,034 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:27:57,041 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-10 05:27:57,053 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-10 05:27:57,077 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:27:57,078 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:27:57,078 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:27:57,078 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:27:57,078 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:27:57,078 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:27:57,079 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:27:57,079 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:27:57,079 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:27:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-11-10 05:27:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 05:27:57,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:57,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:57,101 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:57,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:57,105 INFO L82 PathProgramCache]: Analyzing trace with hash -852454944, now seen corresponding path program 1 times [2018-11-10 05:27:57,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:57,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:57,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:57,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:57,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:57,218 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 05:27:57,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:57,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:27:57,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:27:57,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:27:57,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:27:57,237 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 4 states. [2018-11-10 05:27:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:57,324 INFO L93 Difference]: Finished difference Result 316 states and 434 transitions. [2018-11-10 05:27:57,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:27:57,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-10 05:27:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:57,335 INFO L225 Difference]: With dead ends: 316 [2018-11-10 05:27:57,335 INFO L226 Difference]: Without dead ends: 170 [2018-11-10 05:27:57,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:27:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-10 05:27:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 142. [2018-11-10 05:27:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-10 05:27:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-11-10 05:27:57,374 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 11 [2018-11-10 05:27:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:57,375 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-11-10 05:27:57,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:27:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-10 05:27:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 05:27:57,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:57,376 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 05:27:57,376 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:57,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2063564900, now seen corresponding path program 1 times [2018-11-10 05:27:57,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:57,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:57,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:57,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:57,410 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 05:27:57,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:57,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:57,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:57,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:57,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:57,412 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 3 states. [2018-11-10 05:27:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:57,451 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-11-10 05:27:57,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:57,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 05:27:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:57,452 INFO L225 Difference]: With dead ends: 145 [2018-11-10 05:27:57,452 INFO L226 Difference]: Without dead ends: 143 [2018-11-10 05:27:57,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-10 05:27:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-11-10 05:27:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 05:27:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-11-10 05:27:57,461 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 20 [2018-11-10 05:27:57,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:57,462 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-11-10 05:27:57,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-11-10 05:27:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 05:27:57,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:57,463 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] [2018-11-10 05:27:57,463 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:57,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:57,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1190716927, now seen corresponding path program 1 times [2018-11-10 05:27:57,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:57,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:57,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:57,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:57,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:57,563 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 05:27:57,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:57,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 05:27:57,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:27:57,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:27:57,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:27:57,564 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 7 states. [2018-11-10 05:27:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:57,786 INFO L93 Difference]: Finished difference Result 225 states and 242 transitions. [2018-11-10 05:27:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:27:57,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-10 05:27:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:57,788 INFO L225 Difference]: With dead ends: 225 [2018-11-10 05:27:57,788 INFO L226 Difference]: Without dead ends: 223 [2018-11-10 05:27:57,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:27:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-10 05:27:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 140. [2018-11-10 05:27:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 05:27:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-11-10 05:27:57,798 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 22 [2018-11-10 05:27:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:57,799 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-11-10 05:27:57,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:27:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-11-10 05:27:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 05:27:57,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:57,801 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, 1, 1, 1, 1] [2018-11-10 05:27:57,801 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:57,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash -381373877, now seen corresponding path program 1 times [2018-11-10 05:27:57,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:57,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:57,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:57,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:57,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:57,855 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 05:27:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:27:57,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:27:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:27:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:27:57,856 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 5 states. [2018-11-10 05:27:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:57,954 INFO L93 Difference]: Finished difference Result 336 states and 361 transitions. [2018-11-10 05:27:57,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:27:57,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-10 05:27:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:57,955 INFO L225 Difference]: With dead ends: 336 [2018-11-10 05:27:57,955 INFO L226 Difference]: Without dead ends: 224 [2018-11-10 05:27:57,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:27:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-10 05:27:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2018-11-10 05:27:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 05:27:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-11-10 05:27:57,965 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 28 [2018-11-10 05:27:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:57,965 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-11-10 05:27:57,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:27:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-11-10 05:27:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 05:27:57,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:57,966 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, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:57,966 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:57,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash -840038994, now seen corresponding path program 1 times [2018-11-10 05:27:57,967 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:57,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:57,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:57,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:58,012 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 05:27:58,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:58,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:27:58,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:27:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:27:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:27:58,013 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 5 states. [2018-11-10 05:27:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:58,090 INFO L93 Difference]: Finished difference Result 244 states and 261 transitions. [2018-11-10 05:27:58,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:27:58,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-10 05:27:58,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:58,091 INFO L225 Difference]: With dead ends: 244 [2018-11-10 05:27:58,092 INFO L226 Difference]: Without dead ends: 214 [2018-11-10 05:27:58,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:27:58,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-10 05:27:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 144. [2018-11-10 05:27:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 05:27:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-11-10 05:27:58,098 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 30 [2018-11-10 05:27:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:58,099 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-11-10 05:27:58,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:27:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-11-10 05:27:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 05:27:58,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:58,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:58,100 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:58,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:58,100 INFO L82 PathProgramCache]: Analyzing trace with hash -26232654, now seen corresponding path program 1 times [2018-11-10 05:27:58,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:58,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:58,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:58,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:58,137 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 05:27:58,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:58,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 05:27:58,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:27:58,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:27:58,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:27:58,139 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 6 states. [2018-11-10 05:27:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:58,263 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2018-11-10 05:27:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:27:58,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-10 05:27:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:58,264 INFO L225 Difference]: With dead ends: 221 [2018-11-10 05:27:58,264 INFO L226 Difference]: Without dead ends: 217 [2018-11-10 05:27:58,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:27:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-10 05:27:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 140. [2018-11-10 05:27:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 05:27:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-11-10 05:27:58,271 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 34 [2018-11-10 05:27:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:58,271 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-11-10 05:27:58,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:27:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-11-10 05:27:58,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 05:27:58,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:58,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:58,273 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:58,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2115071859, now seen corresponding path program 1 times [2018-11-10 05:27:58,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:58,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:58,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:58,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:58,309 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 05:27:58,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:58,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:58,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:58,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:58,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:58,311 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 3 states. [2018-11-10 05:27:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:58,324 INFO L93 Difference]: Finished difference Result 242 states and 262 transitions. [2018-11-10 05:27:58,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:58,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-10 05:27:58,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:58,325 INFO L225 Difference]: With dead ends: 242 [2018-11-10 05:27:58,326 INFO L226 Difference]: Without dead ends: 178 [2018-11-10 05:27:58,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-10 05:27:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 145. [2018-11-10 05:27:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-10 05:27:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2018-11-10 05:27:58,332 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 39 [2018-11-10 05:27:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:58,332 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2018-11-10 05:27:58,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2018-11-10 05:27:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 05:27:58,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:58,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:58,334 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:58,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1143268955, now seen corresponding path program 1 times [2018-11-10 05:27:58,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:58,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:58,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:58,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:58,368 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 05:27:58,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:58,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:58,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:58,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:58,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:58,369 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand 3 states. [2018-11-10 05:27:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:58,394 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2018-11-10 05:27:58,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:58,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 05:27:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:58,396 INFO L225 Difference]: With dead ends: 145 [2018-11-10 05:27:58,396 INFO L226 Difference]: Without dead ends: 143 [2018-11-10 05:27:58,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-10 05:27:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-11-10 05:27:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 05:27:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-11-10 05:27:58,400 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 40 [2018-11-10 05:27:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:58,400 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-11-10 05:27:58,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-11-10 05:27:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 05:27:58,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:58,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:58,401 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:58,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash -949752022, now seen corresponding path program 1 times [2018-11-10 05:27:58,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:58,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:58,556 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 05:27:58,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:58,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 05:27:58,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 05:27:58,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:27:58,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:27:58,557 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 10 states. [2018-11-10 05:27:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:58,848 INFO L93 Difference]: Finished difference Result 360 states and 389 transitions. [2018-11-10 05:27:58,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:27:58,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-10 05:27:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:58,849 INFO L225 Difference]: With dead ends: 360 [2018-11-10 05:27:58,849 INFO L226 Difference]: Without dead ends: 293 [2018-11-10 05:27:58,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-11-10 05:27:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-10 05:27:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 184. [2018-11-10 05:27:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-10 05:27:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 200 transitions. [2018-11-10 05:27:58,856 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 200 transitions. Word has length 44 [2018-11-10 05:27:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:58,856 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 200 transitions. [2018-11-10 05:27:58,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 05:27:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 200 transitions. [2018-11-10 05:27:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 05:27:58,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:58,857 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, 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 05:27:58,857 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:58,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:58,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1316889000, now seen corresponding path program 1 times [2018-11-10 05:27:58,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:58,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:58,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:58,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:58,873 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 05:27:58,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:58,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:58,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:58,874 INFO L87 Difference]: Start difference. First operand 184 states and 200 transitions. Second operand 3 states. [2018-11-10 05:27:58,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:58,880 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2018-11-10 05:27:58,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:58,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-10 05:27:58,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:58,881 INFO L225 Difference]: With dead ends: 188 [2018-11-10 05:27:58,882 INFO L226 Difference]: Without dead ends: 186 [2018-11-10 05:27:58,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-10 05:27:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-11-10 05:27:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-10 05:27:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 202 transitions. [2018-11-10 05:27:58,886 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 202 transitions. Word has length 46 [2018-11-10 05:27:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:58,886 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 202 transitions. [2018-11-10 05:27:58,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 202 transitions. [2018-11-10 05:27:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 05:27:58,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:58,887 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, 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 05:27:58,887 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:58,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:58,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1483325013, now seen corresponding path program 1 times [2018-11-10 05:27:58,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:58,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:58,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:58,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:58,965 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 05:27:58,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:58,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 05:27:58,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:27:58,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:27:58,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:27:58,966 INFO L87 Difference]: Start difference. First operand 186 states and 202 transitions. Second operand 7 states. [2018-11-10 05:27:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:59,096 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2018-11-10 05:27:59,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:27:59,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-10 05:27:59,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:59,097 INFO L225 Difference]: With dead ends: 201 [2018-11-10 05:27:59,098 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 05:27:59,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:27:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 05:27:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 182. [2018-11-10 05:27:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-10 05:27:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2018-11-10 05:27:59,103 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 48 [2018-11-10 05:27:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:59,103 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2018-11-10 05:27:59,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:27:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2018-11-10 05:27:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 05:27:59,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:59,104 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, 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 05:27:59,104 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:59,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1789067331, now seen corresponding path program 1 times [2018-11-10 05:27:59,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:59,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:59,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:59,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:59,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:59,328 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 05:27:59,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:59,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 05:27:59,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:27:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:27:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:27:59,329 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand 13 states. [2018-11-10 05:28:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:00,011 INFO L93 Difference]: Finished difference Result 571 states and 614 transitions. [2018-11-10 05:28:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 05:28:00,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-11-10 05:28:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:00,012 INFO L225 Difference]: With dead ends: 571 [2018-11-10 05:28:00,012 INFO L226 Difference]: Without dead ends: 569 [2018-11-10 05:28:00,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2018-11-10 05:28:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-11-10 05:28:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 202. [2018-11-10 05:28:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-10 05:28:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 219 transitions. [2018-11-10 05:28:00,020 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 219 transitions. Word has length 49 [2018-11-10 05:28:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:00,020 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 219 transitions. [2018-11-10 05:28:00,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:28:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 219 transitions. [2018-11-10 05:28:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 05:28:00,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:00,020 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:00,021 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:00,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash 303367713, now seen corresponding path program 1 times [2018-11-10 05:28:00,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:00,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:00,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:00,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:00,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:28:00,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:00,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 05:28:00,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:28:00,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:28:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:28:00,073 INFO L87 Difference]: Start difference. First operand 202 states and 219 transitions. Second operand 7 states. [2018-11-10 05:28:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:00,198 INFO L93 Difference]: Finished difference Result 292 states and 316 transitions. [2018-11-10 05:28:00,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:28:00,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-10 05:28:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:00,200 INFO L225 Difference]: With dead ends: 292 [2018-11-10 05:28:00,200 INFO L226 Difference]: Without dead ends: 264 [2018-11-10 05:28:00,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:28:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-10 05:28:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2018-11-10 05:28:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 05:28:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 275 transitions. [2018-11-10 05:28:00,213 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 275 transitions. Word has length 51 [2018-11-10 05:28:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:00,214 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 275 transitions. [2018-11-10 05:28:00,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:28:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 275 transitions. [2018-11-10 05:28:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 05:28:00,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:00,215 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, 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 05:28:00,215 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:00,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:00,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1562481086, now seen corresponding path program 1 times [2018-11-10 05:28:00,215 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:00,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:00,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:00,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:00,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:00,561 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 05:28:00,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:00,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:28:00,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:28:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:28:00,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:28:00,562 INFO L87 Difference]: Start difference. First operand 250 states and 275 transitions. Second operand 14 states. [2018-11-10 05:28:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:01,324 INFO L93 Difference]: Finished difference Result 669 states and 729 transitions. [2018-11-10 05:28:01,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 05:28:01,324 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-11-10 05:28:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:01,326 INFO L225 Difference]: With dead ends: 669 [2018-11-10 05:28:01,326 INFO L226 Difference]: Without dead ends: 667 [2018-11-10 05:28:01,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-11-10 05:28:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-10 05:28:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 254. [2018-11-10 05:28:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-10 05:28:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2018-11-10 05:28:01,338 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 53 [2018-11-10 05:28:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:01,338 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2018-11-10 05:28:01,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:28:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2018-11-10 05:28:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 05:28:01,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:01,339 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:01,339 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:01,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1002693334, now seen corresponding path program 1 times [2018-11-10 05:28:01,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:01,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:01,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:01,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:01,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:28:01,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:28:01,409 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/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 05:28:01,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:01,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:01,492 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 05:28:01,494 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 05:28:01,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,504 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 05:28:01,509 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 05:28:01,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,517 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-10 05:28:01,533 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 21 treesize of output 16 [2018-11-10 05:28:01,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:28:01,537 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 16 treesize of output 23 [2018-11-10 05:28:01,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,550 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 21 treesize of output 16 [2018-11-10 05:28:01,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:28:01,553 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 16 treesize of output 23 [2018-11-10 05:28:01,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-11-10 05:28:01,597 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 05:28:01,599 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 16 treesize of output 3 [2018-11-10 05:28:01,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,606 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 05:28:01,608 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 16 treesize of output 3 [2018-11-10 05:28:01,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:01,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-10 05:28:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:28:01,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:28:01,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-11-10 05:28:01,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:28:01,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:28:01,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:28:01,647 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand 11 states. [2018-11-10 05:28:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:02,048 INFO L93 Difference]: Finished difference Result 461 states and 501 transitions. [2018-11-10 05:28:02,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 05:28:02,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-11-10 05:28:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:02,051 INFO L225 Difference]: With dead ends: 461 [2018-11-10 05:28:02,051 INFO L226 Difference]: Without dead ends: 356 [2018-11-10 05:28:02,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-11-10 05:28:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-10 05:28:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 256. [2018-11-10 05:28:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 05:28:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 279 transitions. [2018-11-10 05:28:02,066 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 279 transitions. Word has length 55 [2018-11-10 05:28:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:02,067 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 279 transitions. [2018-11-10 05:28:02,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:28:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 279 transitions. [2018-11-10 05:28:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 05:28:02,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:02,067 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:02,068 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:02,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:02,068 INFO L82 PathProgramCache]: Analyzing trace with hash 51821102, now seen corresponding path program 1 times [2018-11-10 05:28:02,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:02,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:02,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:28:02,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:02,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:28:02,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:28:02,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:02,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:02,093 INFO L87 Difference]: Start difference. First operand 256 states and 279 transitions. Second operand 3 states. [2018-11-10 05:28:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:02,138 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2018-11-10 05:28:02,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:02,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-10 05:28:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:02,140 INFO L225 Difference]: With dead ends: 260 [2018-11-10 05:28:02,140 INFO L226 Difference]: Without dead ends: 258 [2018-11-10 05:28:02,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-10 05:28:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2018-11-10 05:28:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-10 05:28:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 277 transitions. [2018-11-10 05:28:02,153 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 277 transitions. Word has length 56 [2018-11-10 05:28:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:02,153 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 277 transitions. [2018-11-10 05:28:02,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:28:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 277 transitions. [2018-11-10 05:28:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 05:28:02,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:02,154 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:02,155 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:02,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:02,155 INFO L82 PathProgramCache]: Analyzing trace with hash -812759309, now seen corresponding path program 1 times [2018-11-10 05:28:02,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:02,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:02,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:02,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:02,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:28:02,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:02,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:28:02,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:28:02,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:28:02,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:28:02,263 INFO L87 Difference]: Start difference. First operand 254 states and 277 transitions. Second operand 8 states. [2018-11-10 05:28:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:02,544 INFO L93 Difference]: Finished difference Result 325 states and 347 transitions. [2018-11-10 05:28:02,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:28:02,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-11-10 05:28:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:02,546 INFO L225 Difference]: With dead ends: 325 [2018-11-10 05:28:02,546 INFO L226 Difference]: Without dead ends: 292 [2018-11-10 05:28:02,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:28:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-10 05:28:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2018-11-10 05:28:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-10 05:28:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 274 transitions. [2018-11-10 05:28:02,560 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 274 transitions. Word has length 60 [2018-11-10 05:28:02,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:02,560 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 274 transitions. [2018-11-10 05:28:02,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:28:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 274 transitions. [2018-11-10 05:28:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 05:28:02,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:02,561 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:02,561 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:02,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1441764470, now seen corresponding path program 1 times [2018-11-10 05:28:02,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:02,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:02,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:28:02,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:02,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:28:02,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:28:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:02,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:02,579 INFO L87 Difference]: Start difference. First operand 252 states and 274 transitions. Second operand 3 states. [2018-11-10 05:28:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:02,601 INFO L93 Difference]: Finished difference Result 421 states and 467 transitions. [2018-11-10 05:28:02,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:02,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-11-10 05:28:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:02,603 INFO L225 Difference]: With dead ends: 421 [2018-11-10 05:28:02,603 INFO L226 Difference]: Without dead ends: 330 [2018-11-10 05:28:02,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-10 05:28:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 288. [2018-11-10 05:28:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-10 05:28:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 316 transitions. [2018-11-10 05:28:02,618 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 316 transitions. Word has length 61 [2018-11-10 05:28:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:02,619 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 316 transitions. [2018-11-10 05:28:02,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:28:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 316 transitions. [2018-11-10 05:28:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 05:28:02,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:02,620 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:02,620 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:02,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1614194142, now seen corresponding path program 1 times [2018-11-10 05:28:02,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:02,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:02,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:02,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:02,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:28:02,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:28:02,713 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/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 05:28:02,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:02,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:02,777 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 05:28:02,793 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 05:28:02,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:28:02,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:02,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:02,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 05:28:02,889 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 15 treesize of output 11 [2018-11-10 05:28:02,890 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 11 treesize of output 3 [2018-11-10 05:28:02,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:28:02,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:02,898 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 24 treesize of output 18 [2018-11-10 05:28:02,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:28:02,901 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 18 treesize of output 10 [2018-11-10 05:28:02,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:28:02,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:02,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:28:02,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-11-10 05:28:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:28:02,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:28:02,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-11-10 05:28:02,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:28:02,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:28:02,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:28:02,941 INFO L87 Difference]: Start difference. First operand 288 states and 316 transitions. Second operand 14 states. [2018-11-10 05:28:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:03,445 INFO L93 Difference]: Finished difference Result 704 states and 768 transitions. [2018-11-10 05:28:03,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 05:28:03,446 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-11-10 05:28:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:03,447 INFO L225 Difference]: With dead ends: 704 [2018-11-10 05:28:03,448 INFO L226 Difference]: Without dead ends: 618 [2018-11-10 05:28:03,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-11-10 05:28:03,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-10 05:28:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 331. [2018-11-10 05:28:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-10 05:28:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 370 transitions. [2018-11-10 05:28:03,463 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 370 transitions. Word has length 64 [2018-11-10 05:28:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:03,463 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 370 transitions. [2018-11-10 05:28:03,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:28:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 370 transitions. [2018-11-10 05:28:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 05:28:03,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:03,464 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 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 05:28:03,465 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:03,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1624169928, now seen corresponding path program 1 times [2018-11-10 05:28:03,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:03,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:03,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:03,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:03,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:03,496 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 05:28:03,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:28:03 BoogieIcfgContainer [2018-11-10 05:28:03,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:28:03,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:28:03,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:28:03,531 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:28:03,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:57" (3/4) ... [2018-11-10 05:28:03,533 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 05:28:03,583 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fa4f160c-0365-49fb-a99d-a4d572394e13/bin-2019/uautomizer/witness.graphml [2018-11-10 05:28:03,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:28:03,584 INFO L168 Benchmark]: Toolchain (without parser) took 7442.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 957.6 MB in the beginning and 851.2 MB in the end (delta: 106.5 MB). Peak memory consumption was 319.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:03,585 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:28:03,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.86 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 933.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:03,586 INFO L168 Benchmark]: Boogie Preprocessor took 86.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 933.5 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:03,586 INFO L168 Benchmark]: RCFGBuilder took 495.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:03,587 INFO L168 Benchmark]: TraceAbstraction took 6509.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 857.7 MB in the end (delta: 206.7 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:03,587 INFO L168 Benchmark]: Witness Printer took 52.27 ms. Allocated memory is still 1.2 GB. Free memory was 857.7 MB in the beginning and 851.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:03,589 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.86 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 933.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 933.5 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 495.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6509.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 857.7 MB in the end (delta: 206.7 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. * Witness Printer took 52.27 ms. Allocated memory is still 1.2 GB. Free memory was 857.7 MB in the beginning and 851.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={14:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L992] FCALL list->next = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L993] COND FALSE !(0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L993] EXPR, FCALL list->inner VAL [list={14:0}, list->inner={13:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={14:0}, list->inner={13:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L993] EXPR, FCALL list->inner VAL [list={14:0}, list->inner={13:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={14:0}, list->inner={13:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L993] EXPR, FCALL list->inner VAL [list={14:0}, list->inner={13:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={13:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L995] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1012] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={14:0}, len=0, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1017] EXPR, FCALL end->inner VAL [end={14:0}, end->inner={13:0}, len=0, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={14:0}, inner={13:0}, len=0, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={14:0}, inner={13:0}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={14:0}, inner={13:0}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1024] COND FALSE !(0) VAL [end={14:0}, inner={13:0}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1025] EXPR, FCALL inner->inner VAL [end={14:0}, inner={13:0}, inner->inner={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={14:0}, inner={13:0}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1026] EXPR, FCALL inner->next VAL [end={14:0}, inner={13:0}, inner->next={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={14:0}, inner={13:0}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1027] EXPR, FCALL inner->inner VAL [end={14:0}, inner={13:0}, inner->inner={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={14:0}, inner={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1029] EXPR, FCALL inner->inner VAL [end={14:0}, inner={0:0}, inner->inner={11:1}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={14:0}, inner={11:1}, len=1, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={14:0}, inner={11:1}, len=2, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={14:0}, inner={11:1}, len=2, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1024] COND FALSE !(0) VAL [end={14:0}, inner={11:1}, len=2, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1025] EXPR, FCALL inner->inner VAL [end={14:0}, inner={11:1}, inner->inner={12:10}, len=2, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={14:0}, inner={11:1}, len=2, list={14:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 13 error locations. UNSAFE Result, 6.4s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2809 SDtfs, 5707 SDslu, 9204 SDs, 0 SdLazy, 3501 SolverSat, 289 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 150 SyntacticMatches, 15 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=19, 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.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 1764 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 998 NumberOfCodeBlocks, 998 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 375356 SizeOfPredicates, 21 NumberOfNonLiveVariables, 297 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 22/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...